Convergence rates for reversible Markov chains without the assumption of nonnegative definite matrices
From MaRDI portal
Publication:625800
DOI10.1007/s11425-010-3139-zzbMath1209.60041MaRDI QIDQ625800
Publication date: 25 February 2011
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-010-3139-z
spectral theory; Markov chain; convergence rate; geometric ergodicity; strong ergodicity; Lyapunov's condition
35P15: Estimates of eigenvalues in context of PDEs
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Related Items
Spectral gap and convergence rate for discrete-time Markov chains, Explicit criteria on separation cutoff for birth and death chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence rates in strong ergodicity for Markov processes
- Exponential convergence to equilibrium for a class of random-walk models
- Explicit bounds of the first eigenvalue.
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Equivalence of exponential ergodicity and \(L^ 2\)-exponential convergence for Markov chains.
- Geometric L2 and L1 convergence are equivalent for reversible Markov chains
- Eigenvalues, Inequalities, and Ergodic Theory
- Exponential ergodicity for single-birth processes