Upcrossing inequalities for stationary sequences and applications

From MaRDI portal
Publication:971935




Abstract: For arrays (Si,j)1leqileqj of random variables that are stationary in an appropriate sense, we show that the fluctuations of the process (S1,n)n=1infty can be bounded in terms of a measure of the ``mean subadditivity of the process (Si,j)1leqileqj. 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 page was built for publication: Upcrossing inequalities for stationary sequences and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971935)