Upcrossing inequalities for stationary sequences and applications

preprint2009arXivOpen access

Abstract

For arrays (Si,j)1≤i≤j(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)1≤i≤j(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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.