Comparison of cutoffs between lazy walks and Markovian semigroups

DOI10.1239/JAP/1389370092MaRDI QIDQ5407019zbMATH OpenOpenAlexFDO

Authors Guan-Yu Chen, Laurent Saloff-Coste

Publication date 4 April 2014

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.4587, https://projecteuclid.org/euclid.jap/1389370092

zbMATH Keywords

cutoff phenomenonMarkov chain

Mathematics Subject Classification ID

Markov semigroups and applications to diffusion processes (47D07) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)

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.

Recommendations

• Characterization of cutoff for reversible Markov chains
• Characterization of cutoff for reversible Markov chains
• A technical report on hitting times, mixing and cutoff
• The \(L^{2}\)-cutoffs for reversible Markov chains
• Total variation cutoff in birth-and-death chains

Cites work

• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• scientific article; zbMATH DE number 1069282 (Why is no real title available?)
• Identifying Coefficients in the Spectral Representation for First Passage Time Distributions
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• On the mixing time and spectral gap for birth and death chains
• Separation cut-offs for birth and death chains
• Strong uniform times and finite random walks
• The cutoff phenomenon for ergodic Markov processes
• The cutoff phenomenon in finite Markov chains.
• Total variation cutoff in birth-and-death chains

Cited in

(15)

• Cutoffs for product chains
• The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill
• On sensitivity of mixing times and cutoff
• No cutoff in spherically symmetric trees
• Products of random walks on finite groups with moderate growth
• Cutoff for permuted Markov chains
• Cutoff for the noisy voter model
• A technical report on hitting times, mixing and cutoff
• Total variation cutoff in a tree
• Cutoff on trees is rare
• Sensitivity of mixing times of Cayley graphs
• Mixing reversible Markov chains in the max-\(\ell^2\)-distance
• Mixing time and cutoff for the k-SPEP
• Cutoff for random walk on random graphs with a community structure
• Total variation cutoff in birth-and-death chains

This page was built for publication: Comparison of cutoffs between lazy walks and Markovian semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5407019)