Equivalences of Geometric Ergodicity of Markov Chains
From MaRDI portal
Abstract: This paper gathers together different conditions which are all equivalent to geometric ergodicity of time-homogeneous Markov chains on general state spaces. A total of 34 different conditions are presented (27 for general chains plus 7 just for reversible chains), some old and some new, in terms of such notions as convergence bounds, drift conditions, spectral properties, etc., with different assumptions about the distance metric used, finiteness of function moments, initial distribution, uniformity of bounds, and more. Proofs of the connections between the different conditions are provided, mostly self-contained but using some results from the literature where appropriate.
Recommendations
- Geometric L2 and L1 convergence are equivalent for reversible Markov chains
- Strengthening ergodicity to geometric ergodicity for markov chains
- Subgeometric ergodicity for continuous-time Markov chains
- A note on the geometric ergodicity of a Markov chain
- Geometric ergodicity for classes of homogeneous Markov chains
Cited in
(4)- The error term in the Cohen-Lenstra heuristic via the random matrix approach
- Geometric Ergodicity of Trans-Dimensional Markov Chain Monte Carlo Algorithms
- On the prime Selmer ranks of cyclic prime twist families of elliptic curves over global function fields
- On the variance reduction of Hamiltonian Monte Carlo via an approximation scheme
This page was built for publication: Equivalences of Geometric Ergodicity of Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6393175)