Papers
Topics
Authors
Recent
Search
2000 character limit reached

Mixing time of the lazy and simple random walk on a randomly twisted hypercube

Published 15 Oct 2026 in math.PR | (2610.21976v1)

Abstract: We consider a randomly twisted hypercube on NN vertices and study a simple or lazy random walk on this graph. We show that for both walks the mixing time is of order log⁡N\log N, and the model does not exhibit cutoff. We also establish that both walks have cover time of order Nlog⁡NN\log N, and we show that the chromatic number of the graph diverges.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.