Cutoff for the cyclic adjacent transposition shuffle
Cutoff for the cyclic adjacent transposition shuffle
复制标题
循环相邻转置洗牌的截止
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
E. Nestoridi
中科院分区：
文献类型：
--
作者：
Danny Nam;E. Nestoridi
我们研究了循环相邻换位（CAT）洗牌的$n$卡，这是一个系统的扫描版本的随机相邻换位（AT）卡洗牌。本文证明了CAT混洗在$frac{n^3}{2 pi^2} log n$处出现截止，从而得出结论：CAT混洗的速度是AT混洗的两倍。
We study the cyclic adjacent transposition (CAT) shuffle of $n$ cards, which is a systematic scan version of the random adjacent transposition (AT) card shuffle. In this paper, we prove that the CAT shuffle exhibits cutoff at $frac{n^3}{2 pi^2} log n$, which concludes that it is twice as fast as the AT shuffle.