A technical report on hitting times, mixing and cutoff

zbMath1388.60137arXiv1501.01869MaRDI QIDQ4603436

Jonathan Hermon

Publication date: 20 February 2018

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

zbMATH Keywords

cutoffhitting timesmaximal inequalitycounter-examplemixing-timefinite reversible Markov chains

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (5)

Some inequalities for reversible Markov chains and branching random walks via spectral optimization ⋮ A threshold for cutoff in two-community random graphs ⋮ CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS ⋮ A spectral characterization for concentration of the cover time ⋮ A comparison principle for random walk on dynamical percolation

Cites Work

• Mixing and hitting times for finite Markov chains
• Mixing times are hitting times of large sets
• Mixing time bounds via the spectral profile
• Characterization of cutoff for reversible Markov chains
• Tight inequalities among set hitting times in Markov chains
• Some Inequalities for Reversible Markov Chains
• Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
• Operator Limit Theorems
• Unnamed Item
• Unnamed Item

This page was built for publication: A technical report on hitting times, mixing and cutoff