A non-local Random Walk on the Hypercube
classification
🧮 math.PR
math.CO
keywords
walkfrachypercubemathbbproverandomchosencoordinates
read the original abstract
This paper studies the random walk on the hypercube $(\mathbb{Z}/2\mathbb{Z})^n$ which at each step flips $k$ randomly chosen coordinates. We prove that the mixing time for this walk is of order $\frac{n}{k} \log n$. We also prove that if $k=o(n)$, then the walk exhibits cutoff at $\frac{n}{2k} \log n$ with window $\frac{n}{2k} $.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.