English

Upcrossing inequalities for stationary sequences and applications

Dynamical Systems 2016-09-07 v3 Probability

Abstract

For arrays (Si,j)1ij(S_{i,j})_{1\leq i\leq j} of random variables that are stationary in an appropriate sense, we show that the fluctuations of the process (S1,n)n=1(S_{1,n})_{n=1}^{\infty} can be bounded in terms of a measure of the ``mean subadditivity'' of the process (Si,j)1ij(S_{i,j})_{1\leq i\leq j}. We derive universal upcrossing inequalities with exponential decay for Kingman's subadditive ergodic theorem, the Shannon--MacMillan--Breiman theorem and for the convergence of the Kolmogorov complexity of a stationary sample.

Keywords

Cite

@article{arxiv.math/0608311,
  title  = {Upcrossing inequalities for stationary sequences and applications},
  author = {Michael Hochman},
  journal= {arXiv preprint arXiv:math/0608311},
  year   = {2016}
}

Comments

Published in at http://dx.doi.org/10.1214/09-AOP460 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

R2 v1 2026-07-22T17:40:34.836Z