Comparison of cutoffs between lazy walks and Markovian semigroups

2013/04/16 by Guan-Yu Chen, Guan‐Yu Chen, Chen, Guan-Yu +3 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Matrix Theory and Algorithms #Probability (math.PR) #Quantum chaos and dynamical systems #math.PR

paper · pdf · doi:10.48550/arxiv.1304.4587

arXiv admin note: text overlap with arXiv:1304.4346

arxiv created 2013/04/16 · openalex publication_date 2013/04/16 · arxiv updated 2013/04/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We make a connection between the continuous time and lazy discrete time Markov chains through the comparison of cutoffs and mixing time in total variation distance. For illustration, we consider finite birth and death chains and provide a criterion on cutoffs using eigenvalues of the transition matrix.

Citations

• On the mixing time and spectral gap for birth and death chains

Cited by

• A curiously slowly mixing Markov chain

Related

• Total-variation cutoff in birth-and-death chains
• The L²-cutoffs for reversible Markov chains
• Computing cutoff times of birth and death chains
• Mixing time and cutoff for one dimensional particle systems
• Cutoff and mixing time for transient random walks in random environments