English

Cutoff for Contingency Table and Torus Random Walks with Low Incremental Correlations

Probability 2026-03-16 v2

Abstract

We use the correlation matrix of the generating distribution to determine the mixing time for random walks on the torus (Z/qZ)n(\mathbb{Z}/q\mathbb{Z})^n. We present our method in the context of the Diaconis-Gangolli random walk on both the 1×n1 \times n and m×nm \times n contingency tables over Z/qZ\mathbb{Z}/q\mathbb{Z}. In the 1×n1 \times n case, we prove that the random walk exhibits cutoff at time nq2log(n)8π2\dfrac{n q^2 \log(n)}{8 \pi^2} when qnq \gg n; in the m×nm \times n case, where m,nm, n are of the same order, we establish cutoff for the random walk at time mnq2log(mn)16π2\dfrac{mn q^2 \log(mn)}{16 \pi^2} when qn2q \gg n^2. Our method reveals that a general class of random walks on the torus (Z/qZ)n(\mathbb{Z}/q\mathbb{Z})^n has cutoff. If each coordinate of the lifted random walk onto Zn\mathbb{Z}^n has variance σ2/n\sigma^2/n in each jump, and the between-coordinate correlations are sufficiently low, then cutoff occurs at time nq2log(n)4π2σ2\dfrac{nq^2 \log(n)}{4\pi^2 \sigma^2}.

Keywords

Cite

@article{arxiv.2407.16203,
  title  = {Cutoff for Contingency Table and Torus Random Walks with Low Incremental Correlations},
  author = {Zihao Fang and Andrew Heeszel},
  journal= {arXiv preprint arXiv:2407.16203},
  year   = {2026}
}

Comments

49 pages, 3 figures, accepted draft at Journal of Theoretical Probability, previous version titled as "Cutoff for Contingency Table Random Walks"

R2 v1 2026-06-28T17:50:26.678Z