arXiv Analytics

Sign in

arXiv:1408.4444 [math.PR]AbstractReferencesReviewsResources

Rate of convergence of the mean for sub-additive ergodic sequences

Antonio Auffinger, Michael Damron, Jack Hanson

Published 2014-08-19Version 1

For sub-additive ergodic processes $\{X_{m,n}\}$ with weak dependence, we analyze the rate of convergence of $\mathbb{E}X_{0,n}/n$ to its limit $g$. We define an exponent $\gamma$ given roughly by $\mathbb{E}X_{0,n} \sim ng + n^\gamma$, and, assuming existence of a fluctuation exponent $\chi$ that gives $ X_{0,n} \sim n^{2\chi}$, we provide a lower bound for $\gamma$ of the form $\gamma \geq \chi$. The main requirement is that $\chi \neq 1/2$. In the case $\chi=1/2$ and under the assumption $\mathop{\mathrm{Var}} X_{0,n} = O(n/(\log n)^\beta)$ for some $\beta>0$, we prove $\gamma \geq \chi - c(\beta)$ for a $\beta$-dependent constant $c(\beta)$. These results show in particular that non-diffusive fluctuations are associated to non-trivial $\gamma$. Various models, including first-passage percolation, directed polymers, the minimum of a branching random walk and bin packing, fall into our general framework, and the results apply assuming $\chi$ exists.

Related articles: Most relevant | Search more
arXiv:math/0310210 [math.PR] (Published 2003-10-15, updated 2006-02-09)
The harmonic explorer and its convergence to SLE(4)
arXiv:1205.2682 [math.PR] (Published 2012-05-11, updated 2012-10-05)
Convergence in total variation on Wiener chaos
arXiv:1103.1426 [math.PR] (Published 2011-03-08, updated 2011-11-01)
Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability