论文信息 - Mixing time of the card-cyclic-to-random shuffle

Mixing time of the card-cyclic-to-random shuffle

The Card-Cyclic-to-Random shuffle on n cards is defined as follows: at time t remove the card with label t mod n and randomly reinsert it back into the deck. Pinsky [9] introduced this shuffle and asked how many steps are needed to mix the deck. He showed n steps do not suffice. Here we show that the mixing time is on the order of Θ(n log n).

Ben Morris | Yuval Peres | Weiyang Ning

[1] P. Diaconis,et al. Generating a random permutation with random transpositions , 1981 .

[2] Martin E. Dyer,et al. Path coupling: A technique for proving rapid mixing in Markov chains , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[3] P. Diaconis,et al. Comparison Techniques for Random Walk on Finite Groups , 1993 .

[4] Rabi Bhattacharya,et al. Random Walk , 2011, International Encyclopedia of Statistical Science.

[5] L. Saloff-Coste,et al. Convergence of some time inhomogeneous Markov chains via spectral techniques , 2007 .

[6] Elizabeth L. Wilmer,et al. Markov Chains and Mixing Times , 2008 .

[7] Yuval Peres,et al. Shuffling by Semi-random Transpositions , 2004 .

[8] Ilya Mironov,et al. (Not So) Random Shuffles of RC4 , 2002, IACR Cryptol. ePrint Arch..

[9] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .

[10] Ross G. Pinsky. Probabilistic and Combinatorial Aspects of the Card-Cyclic to Random Shuffle , 2011 .

[11] P. Diaconis,et al. Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques , 2004, math/0401318.

[12] Eliran Subag,et al. A lower bound for the mixing time of the random-to-random Insertions shuffle , 2011 .