Skip to main content
Log in

Rifle Shuffles and Their Associated Dynamical Systems

  • Published:
Journal of Theoretical Probability Aims and scope Submit manuscript

Abstract

It is shown that for every stationary sequence of random riffle permutations there is a natural associated dynamical system consisting of random orbits in the space of sequences from a finite alphabet. For many interesting models of card-shuffling, the associated dynamical systems have simple descriptions in terms of random or deterministic measure-preserving maps of the unit interval. It is shown that the rate of mixing for a card-shuffling process is constrained by the fiber entropy h of this map: at least (log N)/h repetitions of the shuffle are needed to randomize a deck of size N, when N is large.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Aldous, D. (1983). Random walk on finite groups and rapidly mixing Markov chains. Sem. de Prob. XVII. Lecture Notes in Math. 986, 243–297.

  2. Diaconis, P. (1988). Group Representations in Probability and Statistics, IMS Publications, Hayward California.

    Google Scholar 

  3. Bayer, D., and Diaconis, P. (1992). Trailing the dovetail shuffle to its lair. Ann. Appl. Prob. 2, 294–313.

    Google Scholar 

  4. Diaconis, P., Graham, R., and Kantor, W. (1983). The mathematics of perfect shuffles. Adv. Appl. Math. 4, 175–196.

    Google Scholar 

  5. Diaconis, P., Pitman, J., and McGrath, D. (1995). Riffle shuffles, cycles, and descents. Combinatorica 15, 11–29.

    Google Scholar 

  6. Diaconis, P., and Saloff-Coste, L. (1993). Comparisons techniques for random walks on finite groups. Ann. Probab. 21, 2131–2156.

    Google Scholar 

  7. Lalley, S. (1996). Cycle structure of riffle shuffles. Ann. Prob. 24, 49–73.

    Google Scholar 

  8. Lalley, S. (1998). On the Rate of Mixing for p-Shuffles. Unpublished manuscript. PostScript file available at http://www.stat.purdue.edu/~lalley/Papers.

  9. Mane, R. (1987). Ergodic Theory and Differentiable Dynamics, Springer, New York.

    Google Scholar 

  10. Mann, B. (1995). How many times should you shuffle a deck of cards? In J. L. Snell (ed.), Topics in Contemporary Probability and Its Applications, pp. 261–289.

  11. Petersen, K. (1983). Ergodic Theory, Cambridge University Press.

  12. Reeds, J. (1981). Unpublished manuscript.

  13. Walters, P. (1982). An Introduction to Ergodic Theory, Springer, New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lalley, S.P. Rifle Shuffles and Their Associated Dynamical Systems. Journal of Theoretical Probability 12, 903–932 (1999). https://doi.org/10.1023/A:1021636902356

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021636902356

Navigation