arXiv Analytics

Sign in

arXiv:1003.3515 [math.PR]AbstractReferencesReviewsResources

Explicit expanders with cutoff phenomena

Eyal Lubetzky, Allan Sly

Published 2010-03-18Version 1

The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random walk on a bounded-degree expander graph. The first example of a family of bounded-degree graphs where the random walk exhibits cutoff in total-variation was provided only very recently, when the authors showed this for a typical random regular graph. However, no example was known for an explicit (deterministic) family of expanders with this phenomenon. Here we construct a family of cubic expanders where the random walk from a worst case initial position exhibits total-variation cutoff. Variants of this construction give cubic expanders without cutoff, as well as cubic graphs with cutoff at any prescribed time-point.

Related articles: Most relevant | Search more
arXiv:0812.0060 [math.PR] (Published 2008-11-29, updated 2009-11-05)
Cutoff phenomena for random walks on random regular graphs
arXiv:2101.00533 [math.PR] (Published 2021-01-03)
Cutoff phenomenon for the warp-transpose top with random shuffle
arXiv:1507.04725 [math.PR] (Published 2015-07-16)
Cutoff on all Ramanujan graphs