Mixing times of one-sided $k$-transposition shuffles
Evita Nestoridi, Kenny Peng

TL;DR
This paper investigates the mixing times of the one-sided $k$-transposition shuffle, revealing slow mixing behavior even for large $k$, and explores cutoff phenomena using advanced eigenvector techniques.
Contribution
It introduces new analysis of the mixing times for the one-sided $k$-transposition shuffle and applies the lifting eigenvectors method to study cutoff behavior.
Findings
The shuffle mixes slowly even for large $k$
Different mixing behaviors are identified depending on $k$
Cutoff phenomena are explored using eigenvector techniques
Abstract
We study mixing times of the one-sided -transposition shuffle. We prove that this shuffle mixes relatively slowly, even for big. Using the recent "lifting eigenvectors" technique of Dieker and Saliola and applying the bound, we prove different mixing behaviors and explore the occurrence of cutoff depending on .
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
TopicsAlgorithms and Data Compression · Stochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods
