Explicit criteria on separation cutoff for birth and death chains
DOI10.1007/s11464-014-0380-8zbMath1322.60178OpenAlexW2011151015MaRDI QIDQ2259239
Publication date: 27 February 2015
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-014-0380-8
eigenvaluesdualityboundary theoryhitting timebirth-and-death chainsstochastic monotonicityseparation cutofffastest strong stationary time
Discrete-time Markov processes on general state spaces (60J05) Convergence of probability measures (60B10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Continuous-time Markov processes on discrete state spaces (60J27) Boundary theory for Markov processes (60J50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Speed of stability for birth-death processes
- Convergence rates for reversible Markov chains without the assumption of nonnegative definite matrices
- Strong stationary times via a new form of duality
- Algebraic convergence for discrete-time ergodic Markov chains
- Separation cut-offs for birth and death chains
- Strong uniform times and finite random walks
- Strong stationary duality for continuous-time Markov chains. I: Theory
- What do we know about the Metropolis algorithm?
- Ergodic degrees for continuous-time Markov chains
- Hitting time distributions for denumerable birth and death processes
- The eigentime identity for continuous-time ergodic Markov chains
- The cutoff phenomenon in finite Markov chains.
This page was built for publication: Explicit criteria on separation cutoff for birth and death chains