English

A non-local Random Walk on the Hypercube

Probability 2017-09-21 v3 Combinatorics

Abstract

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

Keywords

Cite

@article{arxiv.1507.05690,
  title  = {A non-local Random Walk on the Hypercube},
  author = {Evita Nestoridi},
  journal= {arXiv preprint arXiv:1507.05690},
  year   = {2017}
}

Comments

17 pages, accepted for publication by the Applied Probability Trust in Advances in Applied Probability 49.4 (December 2017)

R2 v1 2026-06-22T10:15:24.526Z