2000 character limit reached
Cutoff for Contingency Table Random Walks (2407.16203v1)
Published 23 Jul 2024 in math.PR
Abstract: We study the Diaconis-Gangolli random walk on $n \times n$ contingency tables and its analog on $1 \times n$ contingency tables, both over $\mathbb{Z}/q\mathbb{Z}$. In the $1 \times n$ case, we prove that the random walk exhibits cutoff at time $\dfrac{n q2 \log(n)}{8 \pi2}$ when $q \gg n$; in the $n \times n$ case, we establish cutoff for the random walk at time $\dfrac{n2 q2 \log(n)}{8 \pi2}$ when $q \gg n2$. We also show that a general class of random walks on $(\mathbb{Z}/q\mathbb{Z})n$ with a marginal incremental variance $\dfrac{\sigma2}{n}$ (when mapped to $( \mathbb{Z} \cap [-q/2, q/2))n$) has cutoff at time $\dfrac{nq2 \log(n)}{4\pi2 \sigma2}$.