Exponential concentration inequalities for additive functionals of Markov chains

From MaRDI portal



Abstract: Using the renewal approach we prove exponential inequalities for additive functionals and empirical processes of ergodic Markov chains, thus obtaining counterparts of inequalities for sums of independent random variables. The inequalities do not require functions of the chain to be bounded and moreover all the involved constants are given by explicit formulas whenever the usual drift condition holds, which may be of interest in practical applications e.g. to MCMC algorithms.



Cites work


Cited in
(27)








This page was built for publication: Exponential concentration inequalities for additive functionals of Markov chains

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