Mixing times of one-sided k-transposition shuffles

Publication date: 9 December 2021

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

e l l^{2}

bound, we prove different mixing behaviors and explore the occurrence of cutoff depending on

k

.

This page was built for publication: Mixing times of one-sided $k$-transposition shuffles