2000 character limit reached
Subgaussian concentration inequalities for geometrically ergodic Markov chains (1412.1794v2)
Published 4 Dec 2014 in math.PR
Abstract: We prove that an irreducible aperiodic Markov chain is geometrically ergodic if and only if any separately bounded functional of the stationary chain satisfies an appropriate subgaussian deviation inequality from its mean.