Convergence rates for reversible Markov chains without the assumption of nonnegative definite matrices

DOI10.1007/s11425-010-3139-zzbMath1209.60041OpenAlexW1999477431MaRDI QIDQ625800

Yong Hua Mao

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

zbMATH Keywords

spectral theoryMarkov chainconvergence rategeometric ergodicitystrong ergodicityLyapunov's condition

Mathematics Subject Classification ID

Estimates of eigenvalues in context of PDEs (35P15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (3)

Spectral gap and convergence rate for discrete-time Markov chains ⋮ Explicit criteria on separation cutoff for birth and death chains ⋮ Convergence rates in uniform ergodicity by hitting times and \(L^2\)-exponential convergence rates

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 L² and ^{L1 convergence are equivalent for reversible Markov chains}
• Eigenvalues, Inequalities, and Ergodic Theory
• Exponential ergodicity for single-birth processes

This page was built for publication: Convergence rates for reversible Markov chains without the assumption of nonnegative definite matrices