The Annals of Probability

Improved mixing time bounds for the Thorp shuffle and L-reversal chain

Ben Morris

Full-text: Open access

Abstract

We prove a theorem that reduces bounding the mixing time of a card shuffle to verifying a condition that involves only pairs of cards, then we use it to obtain improved bounds for two previously studied models.

E. Thorp introduced the following card shuffling model in 1973: Suppose the number of cards n is even. Cut the deck into two equal piles. Drop the first card from the left pile or from the right pile according to the outcome of a fair coin flip. Then drop from the other pile. Continue this way until both piles are empty. We obtain a mixing time bound of O(log4n). Previously, the best known bound was O(log29n) and previous proofs were only valid for n a power of 2.

We also analyze the following model, called the L-reversal chain, introduced by Durrett: There are n cards arrayed in a circle. Each step, an interval of cards of length at most L is chosen uniformly at random and its order is reversed. Durrett has conjectured that the mixing time is O(max(n, n3/L3)log n). We obtain a bound that is within a factor O(log2n) of this, the first bound within a poly log factor of the conjecture.

Article information

Source
Ann. Probab., Volume 37, Number 2 (2009), 453-477.

Dates
First available in Project Euclid: 30 April 2009

Permanent link to this document
https://projecteuclid.org/euclid.aop/1241099918

Digital Object Identifier
doi:10.1214/08-AOP409

Mathematical Reviews number (MathSciNet)
MR2510013

Zentralblatt MATH identifier
1170.60028

Subjects
Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

Keywords
Markov chain mixing time

Citation

Morris, Ben. Improved mixing time bounds for the Thorp shuffle and L -reversal chain. Ann. Probab. 37 (2009), no. 2, 453--477. doi:10.1214/08-AOP409. https://projecteuclid.org/euclid.aop/1241099918


Export citation

References

  • [1] Bayer, D. and Diaconis, P. (1992). Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2 294–313.
  • [2] Borel, E. and Chéron, A. (1940). Théorie mathématique du bridge à la portée de tous. Gauthier-Villars, Paris.
  • [3] Cancrini, N., Caputo, P. and Martinelli, F. (2006). Relaxation time of L-reversal chains and other chromosome shuffles. Ann. Appl. Probab. 16 1506–1527.
  • [4] Cover, T. M. and Thomas, J. A. (1991). Elements of Information Theory. Wiley, New York.
  • [5] Diaconis, P. Personal Communication.
  • [6] Diaconis, P. and Saloff-Coste, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696–730.
  • [7] Diaconis, P. and Shahshahani, M. (1981). Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Gebiete 57 159–179.
  • [8] Durrett, R. (2003). Probability. Wadsworth and Brooks/Cole Advanced Books and Software, Pacific Grove, CA.
  • [9] Durrett, R. (2003). Shuffling chromosomes. J. Theoret. Probab. 16 725–750.
  • [10] Durrett, R., York, T. and Rasmus, N. (2007). Dependence of paracentric inversion rate on tract length. BioMedCentral Bioinformatics 8 115.
  • [11] Markov, A. A. (1906). Extension of the law of large numbers to dependent events (Russian). Bull. Soc. Math. Kazan (2) 15 135–156.
  • [12] Miclo, L. (1996). Sur les problèmes de sortie discrets inhomogènes. Ann. Appl. Probab. 6 1112–1156.
  • [13] Montenegro, R. and Tetali, P. (2006). Mathematical aspects of mixing times in Markov chains. In Foundations and Trends in Theoretical Computer Science 1 237–354. Now Publishers, Hanover, MA.
  • [14] Morris, B. (2005). The mixing time of the Thorp shuffle. In STOC’05: Proc. 37th Ann. ACM Symp. Theor. Comput. 403–412. ACM, New York.
  • [15] Poincaré, H. (1912). Calcul des probabilités, 2nd ed. Gauthier Villars, Paris.
  • [16] Wilson, D. B. (2004). Mixing times of Lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab. 14 274–325.