2021/12/09 by Evita Nestoridi, Kenny Peng, Nestoridi, Evita +2
Computer Science · Mathematics · #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR) #Representation Theory (math.RT) #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.2112.05085
openalex publication_date 2021/12/09 · openalex created_date 2022/05/05 · openalex updated_date 2026/07/28
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 ℓ2 bound, we prove different mixing behaviors and explore the occurrence of cutoff depending on k.