Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.13851

Upper Bound for Permanent Saturation of Metric Graphs using Interval Exchange Transformations

Egor Ermolaev·Vsevolod Chernyshev·Alexandra Skripchenko
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study upper bounds for the moment of permanent $\varepsilon$-saturation in finite metric graphs. The dynamics is generated by moving points travelling with unit speed along edges and branching into all outgoing directions whenever they reach a vertex. We first reformulate this branched dynamics in terms of birth times at vertices and prove a sufficient same-time criterion for permanent $\varepsilon$-saturation. The main rigorous estimate is obtained from a rotation, regarded as a two-interval exchange transformation. More precisely, if the graph contains two closed walks based at the initial vertex whose lengths have irrational ratio, then the covering properties of the corresponding rotation imply an explicit upper bound for the permanent saturation time. In particular, bounded-type rotations yield a bound of order $\varepsilon^{-1}$. We also construct a more general auxiliary interval exchange transformation on the set of oriented edges. This construction depends on cyclic orders at the vertices and organizes the ordered edge-state data of the graph. Since the branched graph dynamics is non-invertible, whereas an interval exchange transformation is invertible away from discontinuities, this auxiliary IET is not identified with the full graph dynamics. Instead, we formulate the additional birth-time transfer property required for recurrence estimates of the auxiliary IET to imply saturation bounds. We also discuss rotation-type and non-rotation examples of graph-induced self-similar IETs, together with numerical illustrations for star and complete graphs.

Explore related subjects

math.DSmath-phmath.COmath.MP

Keep this discovery

BibTeXRIS

Egor Ermolaev, Vsevolod Chernyshev, Alexandra Skripchenko. 2025-12-15. Upper Bound for Permanent Saturation of Metric Graphs using Interval Exchange Transformations. https://arxiv.org/abs/2512.13851

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS↗
arXiv2026

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS↗
arXiv2026

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS↗