← All problems

Durrett's mixing-time conjecture for lazy random walk on random 3-regular graphs

18 years old · traced to

Let G∼G(n,3)G\sim\mathcal{G}(n,3) be a random 33-regular graph, and consider the lazy random walk on GG. Its mixing time is measured in total variation and the lazy walk stays in place with probability 1/21/2 at each step. Durrett's conjecture. The mixing time for the lazy random walk on the random 33-regular graph is asymptotically

6log⁡2n.6\log_2 n.
References

Status

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.