Rate of convergence of the mean for sub-additive ergodic sequences
Antonio Auffinger, Michael Damron, Jack Hanson

TL;DR
This paper investigates the rate at which the expected value of sub-additive ergodic processes converges to its limit, establishing bounds related to fluctuation exponents and applying to models like first-passage percolation and directed polymers.
Contribution
It introduces bounds on the convergence rate exponent for sub-additive ergodic sequences, linking it to fluctuation exponents and extending results to various models.
Findings
Established lower bounds for the convergence rate exponent b3 based on fluctuation exponent b3 .
Connected non-diffusive fluctuations to non-trivial convergence rates.
Applied results to models including first-passage percolation, directed polymers, and branching random walks.
Abstract
For sub-additive ergodic processes with weak dependence, we analyze the rate of convergence of to its limit . We define an exponent given roughly by , and, assuming existence of a fluctuation exponent that gives , we provide a lower bound for of the form . The main requirement is that . In the case and under the assumption for some , we prove for a -dependent constant . These results show in particular that non-diffusive fluctuations are associated to non-trivial . Various models, including first-passage percolation, directed polymers, the minimum of a branching random walk and bin packing, fall into…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
