Papers
Topics
Authors
Recent
Search
2000 character limit reached

A non-local Random Walk on the Hypercube

Published 21 Jul 2015 in math.PR and math.CO | (1507.05690v3)

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} $.

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.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.