Explicit expanders with cutoff phenomena

DOI10.1214/EJP.v16-869zbMath1226.60098arXiv1003.3515MaRDI QIDQ638392

Eyal Lubetzky, Allan Sly

Publication date: 9 September 2011

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

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

zbMATH Keywords

random walkcutoff phenomenonexpander graph

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Convergence of probability measures (60B10) Random walks on graphs (05C81)

Related Items (8)

On sensitivity of uniform mixing times ⋮ Cutoff on all Ramanujan graphs ⋮ The probability of long cycles in interchange processes ⋮ A threshold for cutoff in two-community random graphs ⋮ Cutoff phenomenon for random walks on Kneser graphs ⋮ On sensitivity of mixing times and cutoff ⋮ An exposition to information percolation for the Ising model ⋮ From Ramanujan graphs to Ramanujan complexes

This page was built for publication: Explicit expanders with cutoff phenomena