Cutoff for Contingency Table and Torus Random Walks with Low Incremental Correlations
Zihao Fang, Andrew Heeszel

TL;DR
This paper determines the cutoff times for certain random walks on contingency tables and tori, showing how low correlations and variance influence mixing times and establishing cutoff phenomena in these settings.
Contribution
It introduces a method using the correlation matrix to determine cutoff times for random walks on the torus and contingency tables, extending previous results to low-correlation cases.
Findings
Cutoff occurs at specific times depending on table dimensions and parameters.
Low correlation and variance conditions lead to predictable cutoff times.
The method applies broadly to random walks with low inter-coordinate correlations.
Abstract
We use the correlation matrix of the generating distribution to determine the mixing time for random walks on the torus . We present our method in the context of the Diaconis-Gangolli random walk on both the and contingency tables over . In the case, we prove that the random walk exhibits cutoff at time when ; in the case, where are of the same order, we establish cutoff for the random walk at time when . Our method reveals that a general class of random walks on the torus has cutoff. If each coordinate of the lifted random walk onto has variance in each jump, and the between-coordinate correlations are sufficiently low, then cutoff…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
