Cutoff on trees is rare

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Processes in random environments (60K37) Continuous-time Markov processes on discrete state spaces (60J27)

Cites Work

Unnamed Item
Unnamed Item
Spectral gap, isoperimetry and concentration on trees
Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
Mixing times are hitting times of large sets
Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
The continuum random tree. I
Total variation cutoff in birth-and-death chains
On eigenfunctions of Markov processes on trees
Cutoff phenomena for random walks on random regular graphs
Subdiffusive behavior of random walk on a random cluster
Relations between isoperimetry and spectral gap for finite Markov chains
Lectures on probability theory and statistics. Ecole d'été de probabilités de Saint-Flour XXVI--1996. Lectures given at the Saint-Flour summer school of probability theory, August 19--September 4, 1996
Most trees are short and fat
Random walks on the random graph
Characterization of cutoff for reversible Markov chains
Cutoff for nonbacktracking random walks on sparse random graphs
The full spectrum of random walks on complete finite \(d\)-ary trees
No cutoff in spherically symmetric trees
The continuum random tree. III
Computing cutoff times of birth and death chains
Probability on Trees and Networks
Mixing times for the interchange process
On the mixing time and spectral gap for birth and death chains
Shuffling Cards and Stopping Times
Generating a random permutation with random transpositions
Some Inequalities for Reversible Markov Chains
Weighted Hardy and Poincaré Inequalities on Trees
Centers for Random Walks on Trees
The CRT is the scaling limit of unordered binary trees
Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
Total variation cutoff in a tree

This page was built for publication: Cutoff on trees is rare