Upcrossing inequalities for stationary sequences and applications
classification
🧮 math.DS
math.PR
keywords
stationaryinequalitiesprocesstheoremupcrossingapplicationsappropriatearrays
read the original abstract
For arrays $(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 $(S_{1,n})_{n=1}^{\infty}$ can be bounded in terms of a measure of the ``mean subadditivity'' of the process $(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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.