Open Access
February 2006 The overhand shuffle mixes in Θ(n2logn) steps
Johan Jonasson
Ann. Appl. Probab. 16(1): 231-243 (February 2006). DOI: 10.1214/105051605000000692
Abstract

The overhand shuffle is one of the “real” card shuffling methods in the sense that some people actually use it to mix a deck of cards. A mathematical model was constructed and analyzed by Pemantle [J. Theoret. Probab. 2 (1989) 37–49] who showed that the mixing time with respect to variation distance is at least of order n2 and at most of order n2logn. In this paper we use an extension of a lemma of Wilson [Ann. Appl. Probab. 14 (2004) 274–325] to establish a lower bound of order n2logn, thereby showing that n2logn is indeed the correct order of the mixing time. It is our hope that the extension of Wilson’s lemma will prove useful also in other situations; it is demonstrated how it may be used to give a simplified proof of the Θ(n3logn) lower bound of Wilson [Electron. Comm. Probab. 8 (2003) 77–85] for the Rudvalis shuffle.

References

1.

Aldous, D. (1983). Random walks on finite groups and rapidly mixing Markov chains. Séminaire de Probabilités XVII. Lecture Notes in Math. 986 243–297. Springer, Berlin.  MR770418 Aldous, D. (1983). Random walks on finite groups and rapidly mixing Markov chains. Séminaire de Probabilités XVII. Lecture Notes in Math. 986 243–297. Springer, Berlin.  MR770418

2.

Bayer, D. and Diaconis, P. (1992). Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2 294–313.  MR1161056 0757.60003 10.1214/aoap/1177005705 euclid.aoap/1177005705 Bayer, D. and Diaconis, P. (1992). Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2 294–313.  MR1161056 0757.60003 10.1214/aoap/1177005705 euclid.aoap/1177005705

3.

Hildebrand, M. (1990). Rates of convergence of some random processes on finite groups. Ph.D. thesis, Harvard Univ. Hildebrand, M. (1990). Rates of convergence of some random processes on finite groups. Ph.D. thesis, Harvard Univ.

4.

Mossel, E., Peres, Y. and Sinclair, A. (2004). Shuffling by semi-random transpositions. FOCS 2004. Mossel, E., Peres, Y. and Sinclair, A. (2004). Shuffling by semi-random transpositions. FOCS 2004.

5.

Pemantle, R. (1989). Randomization time for the overhand shuffle. J. Theoret. Probab. 2 37–49.  MR981762 0668.60060 10.1007/BF01048267 Pemantle, R. (1989). Randomization time for the overhand shuffle. J. Theoret. Probab. 2 37–49.  MR981762 0668.60060 10.1007/BF01048267

6.

Wilson, D. B. (2003). Mixing time of the Rudvalis shuffle. Electron. Comm. Probab. 8 77–85.  MR1987096 1061.60074 10.1214/ECP.v8-1071 euclid.ecp/1463608892 Wilson, D. B. (2003). Mixing time of the Rudvalis shuffle. Electron. Comm. Probab. 8 77–85.  MR1987096 1061.60074 10.1214/ECP.v8-1071 euclid.ecp/1463608892

7.

Wilson, D. B. (2004). Mixing times of lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab. 14 274–325.  MR2023023 1040.60063 10.1214/aoap/1075828054 euclid.aoap/1075828054 Wilson, D. B. (2004). Mixing times of lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab. 14 274–325.  MR2023023 1040.60063 10.1214/aoap/1075828054 euclid.aoap/1075828054
Copyright © 2006 Institute of Mathematical Statistics
Johan Jonasson "The overhand shuffle mixes in Θ(n2logn) steps," The Annals of Applied Probability 16(1), 231-243, (February 2006). https://doi.org/10.1214/105051605000000692
Published: February 2006
Vol.16 • No. 1 • February 2006
Back to Top