Author:
Chen Guan-Yu,Saloff-Coste Laurent
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.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cutoff on Trees is Rare;Journal of Theoretical Probability;2023-07-31
2. Sensitivity of mixing times of Cayley graphs;Canadian Journal of Mathematics;2023-07-18
3. Cutoff for permuted Markov chains;Annales de l'Institut Henri Poincaré, Probabilités et Statistiques;2023-02-01
4. No cutoff in Spherically symmetric trees;Electronic Communications in Probability;2022-01-01
5. Cutoffs for product chains;Stochastic Processes and their Applications;2018-11