Comparison of cutoffs between lazy walks and Markovian semigroups

DOI10.1239/JAP/1389370092zbMATH Open1288.60088arXiv1304.4587OpenAlexW2008824346MaRDI QIDQ5407019FDOQ5407019

Authors: Guan-Yu Chen, Laurent Saloff-Coste 

Publication date: 4 April 2014

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

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.

Full work available at URL: https://arxiv.org/abs/1304.4587

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

zbMATH Keywords

Markov chaincutoff phenomenon

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)

Cites Work

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

Cited In (13)

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

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)