Criteria for strong ergodicity of Markov chains
- 1 March 1978
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 15 (1), 87-95
- https://doi.org/10.2307/3213239
Abstract
For finite Markov chains, the concepts of ergodicity and strong ergodicity are equivalent, but this is not necessarily the case when the state space is infinite. In this note we give some new characterizations of strong ergodicity. These lead to simple necessary or sufficient criteria for strong ergodicity, which readily enable us to classify a number of examples.Keywords
This publication has 12 references indexed in Scilit:
- A splitting technique for Harris recurrent Markov chainsProbability Theory and Related Fields, 1978
- Algebraic characterization of infinite Markov chains where movement to the right is limited to one stepJournal of Applied Probability, 1977
- Hitting times of Markov chains, with application to state-dependent queuesBulletin of the Australian Mathematical Society, 1977
- Ergodicity Using Mean Visit TimesJournal of the London Mathematical Society, 1976
- Criteria for classifying general Markov chainsAdvances in Applied Probability, 1976
- The robustness of positive recurrence and recurrence of Markov chains under perturbations of the transition probabilitiesJournal of Applied Probability, 1975
- The robustness of positive recurrence and recurrence of Markov chains under perturbations of the transition probabilitiesJournal of Applied Probability, 1975
- Geometric ergodicity in a class of denumerable Markov chainsProbability Theory and Related Fields, 1966
- Central Limit Theorem for Nonstationary Markov Chains. ITheory of Probability and Its Applications, 1956
- On the Stochastic Matrices Associated with Certain Queuing ProcessesThe Annals of Mathematical Statistics, 1953