A Sequential Birkhoff Theorem for Slow Logarithmic Drift in Non-Uniformly Expanding Unimodal Maps

We prove a sequential (non-autonomous) Birkhoff ergodic theorem for compositions of unimodal maps f_{u_n}(x) = 1 − u_n x² whose parameters drift slowly to a Misiurewicz value u_c. Working under an explicit uniform-inducing-scheme hypothesis — a uniform Young tower with uniform Lasota–Yorke constants and Keller–Liverani spectral stability across the relevant parameter set — we show that for every bounded-variation observable, the time average along the sequential orbit converges in mean (indeed in L², hence in probability) to the spatial average against the unique absolutely continuous invariant measure μ_{u_c} of the limiting autonomous map, whenever the drift tail sup_{k≥n}|u_k − u_c| tends to zero. For the logarithmic schedule |u_n − u_c| ≤ c (log n)^{−β} we further obtain almost-everywhere convergence when β > 1, the threshold at which the second-moment estimate becomes summable along a ratio-one subsequence. The proof passes to the induced first-return map, where the dynamics is uniformly expanding, and combines a uniform spectral gap with a Cesàro estimate of the accumulated drift error. The result supplies the ergodic foundation — convergence of symbolic cylinder frequencies to the band-merging statistics — for non-autonomous symbolic models of arithmetic sequences; we delimit precisely what it does and does not yield for the associated density envelopes.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-06-16
DOI
https://doi.org/10.5281/zenodo.20711935
Primary Topic
Mathematical Dynamics and Fractals
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

A Sequential Birkhoff Theorem for Slow Logarithmic Drift in Non-Uniformly Expanding Unimodal Maps

Liang Wang
Zenodo (CERN European Organization for Nuclear Research)
Mathematical Dynamics and Fractals
preprint

A Sequential Birkhoff Theorem for Slow Logarithmic Drift in Non-Uniformly Expanding Unimodal Maps

Liang Wang
preprint en

Abstract

We prove a sequential (non-autonomous) Birkhoff ergodic theorem for compositions of unimodal maps f_{u_n}(x) = 1 − u_n x² whose parameters drift slowly to a Misiurewicz value u_c. Working under an explicit uniform-inducing-scheme hypothesis — a uniform Young tower with uniform Lasota–Yorke constants and Keller–Liverani spectral stability across the relevant parameter set — we show that for every bounded-variation observable, the time average along the sequential orbit converges in mean (indeed in L², hence in probability) to the spatial average against the unique absolutely continuous invariant measure μ_{u_c} of the limiting autonomous map, whenever the drift tail sup_{k≥n}|u_k − u_c| tends to zero. For the logarithmic schedule |u_n − u_c| ≤ c (log n)^{−β} we further obtain almost-everywhere convergence when β > 1, the threshold at which the second-moment estimate becomes summable along a ratio-one subsequence. The proof passes to the induced first-return map, where the dynamics is uniformly expanding, and combines a uniform spectral gap with a Cesàro estimate of the accumulated drift error. The result supplies the ergodic foundation — convergence of symbolic cylinder frequencies to the band-merging statistics — for non-autonomous symbolic models of arithmetic sequences; we delimit precisely what it does and does not yield for the associated density envelopes.

Zenodo (CERN European Organization for Nuclear Research)
Huazhong University of Science and Technology (CN)
Mathematical Dynamics and Fractals
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.