Bounds on regeneration times and convergence rates for Markov chains
- 1 April 1999
- journal article
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 80 (2) , 211-229
- https://doi.org/10.1016/s0304-4149(98)00085-4
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Markov chains and polynomial time algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Shift-coupling and convergence rates of ergodic averagesCommunications in Statistics. Stochastic Models, 1997
- Geometric Convergence Rates for Stochastically Ordered Markov ChainsMathematics of Operations Research, 1996
- Rates of convergence of the Hastings and Metropolis algorithmsThe Annals of Statistics, 1996
- Computable Bounds for Geometric Convergence Rates of Markov ChainsThe Annals of Applied Probability, 1994
- Markov Chains and Stochastic StabilityPublished by Springer Nature ,1993
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991
- General Irreducible Markov Chains and Non-Negative OperatorsPublished by Cambridge University Press (CUP) ,1984
- A splitting technique for Harris recurrent Markov chainsProbability Theory and Related Fields, 1978
- A new approach to the limit theory of recurrent Markov chainsTransactions of the American Mathematical Society, 1978