Mixing times of one-sided k-transposition shuffles
classification
🧮 math.PR
math.COmath.RT
keywords
mixingone-sidedproveshuffletimestranspositionapplyingbehaviors
read the original abstract
We study mixing times of the one-sided $k$-transposition shuffle. We prove that this shuffle mixes relatively slowly, even for $k$ big. Using the recent ``lifting eigenvectors'' technique of Dieker and Saliola and applying the $\ell^2$ bound, we prove different mixing behaviors and explore the occurrence of cutoff depending on $k$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.