English

Rosenthal-type inequalities for linear statistics of Markov chains

Probability 2025-09-26 v3 Statistics Theory Machine Learning Statistics Theory

Abstract

In this paper, we establish novel concentration inequalities for additive functionals of geometrically ergodic Markov chains similar to Rosenthal inequalities for sums of independent random variables. We pay special attention to the dependence of our bounds on the mixing time of the corresponding chain. Precisely, we establish explicit bounds that are linked to the constants from the martingale version of the Rosenthal inequality, as well as the constants that characterize the mixing properties of the underlying Markov kernel. Finally, our proof technique is, up to our knowledge, new and is based on a recurrent application of the Poisson decomposition.

Keywords

Cite

@article{arxiv.2303.05838,
  title  = {Rosenthal-type inequalities for linear statistics of Markov chains},
  author = {Alain Durmus and Eric Moulines and Alexey Naumov and Sergey Samsonov and Marina Sheshukova},
  journal= {arXiv preprint arXiv:2303.05838},
  year   = {2025}
}

Comments

Revised exposition and updated the LSA example. Main results are unchanged