Remarks on cutoff phenomena for random walks on Hamming Schemes
Katsuhiko Kikuchi

TL;DR
This paper investigates the cutoff phenomenon for simple random walks on Hamming schemes, providing explicit bounds for total variation distances to better understand the mixing times.
Contribution
It introduces simple majorant and sharp minorant functions for total variation distances in the context of random walks on Hamming schemes with q ≥ 3.
Findings
Established cutoff phenomenon for q ≥ 3
Derived explicit bounds for total variation distances
Provided simple functions to estimate mixing times
Abstract
The sequence of the simple random walks on Hamming schemes has a cutoff phenomenon for each integer greater than or equal to . In this paper, for the sequence of simple random walks on Hamming schemes with , we give a simple majorant and a sharp minorant function for total variance distances between transition distributions and stationary distributions.
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.
Taxonomy
TopicsAnalytic Number Theory Research · Random Matrices and Applications · Stochastic processes and statistical mechanics
