Mixing times of one-sided $k$-transposition shuffles

arxiv(2021)

引用 0|浏览0
暂无评分
摘要
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$.
更多
查看译文
关键词
mixing,one-sided
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要