arXiv Analytics

Sign in

arXiv:1212.2015 [math.PR]AbstractReferencesReviewsResources

Concentration inequalities for Markov chains by Marton couplings and spectral methods

Daniel Paulin

Published 2012-12-10, updated 2015-01-11Version 4

We prove a version of McDiarmid's bounded differences inequality for Markov chains, with constants proportional to the mixing time of the chain. We also show variance bounds and Bernstein-type inequalities for empirical averages of Markov chains. In the case of non-reversible chains, we introduce a new quantity called the "pseudo spectral gap", and show that it plays a similar role for non-reversible chains as the spectral gap plays for reversible chains. Our techniques for proving these results are based on a coupling construction of Katalin Marton, and on spectral techniques due to Pascal Lezaud. The pseudo spectral gap generalises the multiplicative reversiblication approach of Jim Fill.

Comments: 38 pages. Minor changes in this version
Categories: math.PR
Subjects: 60E15, 60J05, 60J10, 28A35, 05C81, 68Q87
Related articles: Most relevant | Search more
arXiv:1210.1116 [math.PR] (Published 2012-10-03, updated 2014-03-24)
Stochastic Comparisons between hitting times for Markov Chains and words' occurrences
arXiv:math/0507526 [math.PR] (Published 2005-07-26, updated 2016-03-08)
Concentration inequalities with exchangeable pairs (Ph.D. thesis)
arXiv:math/0006145 [math.PR] (Published 2000-06-20)
Semigroups, rings, and Markov chains