A non-local Random Walk on the Hypercube

Abstract

This paper studies the random walk on the hypercube (Z/2Z)n which at each step flips k randomly chosen coordinates. We prove that the mixing time for this walk is of order nk n. We also prove that if k=o(n), then the walk exhibits cutoff at n2k n with window n2k .

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…