Cutoff for Ramanujan graphs via degree inflation

DOI10.1214/17-ECP72zbMath1378.05188arXiv1702.08034MaRDI QIDQ2411767

Jonathan Hermon

Publication date: 25 October 2017

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

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

zbMATH Keywords

cutoffRamanujan graphsdegree inflation

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Convergence of probability measures (60B10) Distance in graphs (05C12) Random walks on graphs (05C81)

Related Items (3)

Universality of cutoff for graphs with an added random matching ⋮ An entropic proof of cutoff on Ramanujan graphs ⋮ CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS

This page was built for publication: Cutoff for Ramanujan graphs via degree inflation