Exponential Concentration Inequalities for Additive Functionals of Markov Chains
classification
🧮 math.PR
keywords
inequalitiesadditivechainsexponentialfunctionalsmarkovalgorithmsapplications
read the original 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.
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.