No cutoff in spherically symmetric trees

DOI10.1214/22-ECP468zbMath1489.05129arXiv2107.14111MaRDI QIDQ2137746

Yuval Peres, Rafael Chiclana

Publication date: 16 May 2022

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

treecutoffMarkov chainsrandom walksmixing time

Mathematics Subject Classification ID

Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Mixing times are hitting times of large sets
• Sensitivity of mixing times
• Coincidence properties of birth and death processes
• The speed of the tagged particle in the exclusion process on Galton-Watson trees
• The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
• Cutoff phenomena for random walks on random regular graphs
• Markov chain models - rarity and exponentiality
• Inequalities for rare events in time-reversible Markov chains. I.
• On sensitivity of mixing times and cutoff
• Mixing time bounds via bottleneck sequences
• Nonconcentration of return times
• Characterization of cutoff for reversible Markov chains
• Comparing mixing times on sparse random graphs
• Logarithmic Sobolev inequalities for finite Markov chains
• Shuffling Cards and Stopping Times
• Generating a random permutation with random transpositions
• Surprise Probabilities in Markov Chains
• Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
• Total variation cutoff in a tree