Comparison of cutoffs between lazy walks and Markovian semigroups
classification
🧮 math.PR
keywords
cutoffstimechainscomparisonlazybirthconnectionconsider
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.