Skip to main content

Shuffling cards

  • Chapter
Proofs from THE BOOK

Abstract

The analysis of random processes is a familiar duty in life (“How long does it take to get to the airport during rush-hour?”) as well as in mathematics. Of course, getting meaningful answers to such problems heavily depends on formulating meaningful questions. For the card shuffling problem, this means that we have

  • to specify the size of the deck (n = 52 cards, say),

  • to say how we shuffle (we’ll analyze top-in-at-random shuffles first, and then the more realistic and effective riffle shuffles), and finally

  • to explain what we mean by “is random” or “is close to random.”

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Aldous & P. Diaconis: Shuffling cards and stopping times, Amer. Math. Monthly 93 (1986), 333–348.

    Article  MathSciNet  MATH  Google Scholar 

  2. D. Bayer & P. Diaconis: Trailing the dovetail shuffle to its lair, Annals Applied Probability 2 (1992), 294–313.

    Article  MathSciNet  MATH  Google Scholar 

  3. E. Behrends: Introduction to Markov Chains, Vieweg, Braunschweig/ Wiesbaden 2000.

    MATH  Google Scholar 

  4. P. Diaconis: Mathematical developments from the analysis of riffle shuffling, in: “Groups, Combinatorics and Geometry. Durham 2001” (A. A. Ivanov, M. W. Liebeck and J. Saxl, eds.), World Scientific, Singapore 2003, pp. 73–97.

    Google Scholar 

  5. M. Gardner: Mathematical Magic Show, Knopf, New York/Allen & Unwin, London 1977.

    Google Scholar 

  6. E. N. Gilbert: Theory of Shuffl ing, Technical Memorandum, Bell Laboratories, Murray Hill NJ, 1955.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Aigner, M., Ziegler, G.M. (2004). Shuffling cards. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05412-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-05412-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-05414-7

  • Online ISBN: 978-3-662-05412-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics