Variance bounding Markov chains

Abstract

We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all $L^2$ functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Peskun order. We close with some applications to Metropolis--Hastings algorithms.

Published in at http://dx.doi.org/10.1214/07-AAP486 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (2)

• Basic Properties of Strong Mixing Conditions. A Survey and Some Open Questions
• Sufficient burn-in for Gibbs samplers for a hierarchical random effects model

Cited by in corpus (5)

• A theoretical comparison of the data augmentation, marginal augmentation and PX-DA algorithms
• Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
• Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
• Convergence of hybrid slice sampling via spectral gap
• Discrepancy estimates for variance bounding Markov chain quasi-Monte Carlo