Renewal theory and computable convergence rates for geometrically ergodic Markov chains
Open Access
- 1 February 2005
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 15 (1B)
- https://doi.org/10.1214/105051604000000710
Abstract
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and Tweedie, and from estimates using coupling, although we start from essentially the same assumptions of a drift condition toward a ``small set.'' The estimates show a noticeable improvement on existing results if the Markov chain is reversible with respect to its stationary distribution, and especially so if the chain is also positive. The method of proof uses the first-entrance-last-exit decomposition, together with new quantitative versions of a result of Kendall from discrete renewal theory.Comment: Published at http://dx.doi.org/10.1214/105051604000000710 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.orgKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Quantitative bounds on convergence of time-inhomogeneous Markov chainsThe Annals of Applied Probability, 2004
- Asymptotic Variance and Convergence Rates of Nearly-Periodic Markov Chain Monte Carlo AlgorithmsJournal of the American Statistical Association, 2003
- Polynomial ergodicity of Markov transition kernelsStochastic Processes and their Applications, 2003
- Bounds on regeneration times and convergence rates for Markov chainsStochastic Processes and their Applications, 1999
- Geometric Ergodicity and Hybrid Markov ChainsElectronic Communications in Probability, 1997
- Shift-coupling and convergence rates of ergodic averagesCommunications in Statistics. Stochastic Models, 1997
- Minorization Conditions and Convergence Rates for Markov Chain Monte CarloJournal of the American Statistical Association, 1995
- Computable Bounds for Geometric Convergence Rates of Markov ChainsThe Annals of Applied Probability, 1994
- Geometric ergodicity of Harris recurrent Marcov chains with applications to renewal theoryStochastic Processes and their Applications, 1982
- Geometric Ergodicity and R-positivity for General Markov ChainsThe Annals of Probability, 1978