Article contents
A non-local random walk on the hypercube
Published online by Cambridge University Press: 17 November 2017
Abstract
In this paper we study the random walk on the hypercube (ℤ / 2ℤ)n which at each step flips k randomly chosen coordinates. We prove that the mixing time for this walk is of the order (n / k)logn. We also prove that if k = o(n) then the walk exhibits cutoff at (n / 2k)logn with window n / 2k.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Applied Probability Trust 2017
References
- 3
- Cited by