Mixing times of one-sided $k$-transposition shuffles
Probability
2021-12-10 v1 Combinatorics
Representation Theory
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 .
Cite
@article{arxiv.2112.05085,
title = {Mixing times of one-sided $k$-transposition shuffles},
author = {Evita Nestoridi and Kenny Peng},
journal= {arXiv preprint arXiv:2112.05085},
year = {2021}
}