Durrett's mixing-time conjecture for lazy random walk on random 3-regular graphs
Let be a random -regular graph, and consider the lazy random walk on . Its mixing time is measured in total variation and the lazy walk stays in place with probability at each step. Durrett's conjecture. The mixing time for the lazy random walk on the random -regular graph is asymptotically
References
Status
- Solved: Eyal Lubetzky and Allan Sly. Cutoff phenomena for random walks on random regular graphs (Duke Mathematical Journal, 2010) https://projecteuclid.org/journals/duke-mathematical-journal/volume-153/issue-3/Cutoff-phenomena-for-random-walks-on-random-regular-graphs/10.1215/00127094-2010-029.short
Source: Eyal Lubetzky and Allan Sly, “Cutoff phenomena for random walks on random regular graphs”, arXiv:0812.0060 (2009).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.