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.”
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Aldous & P. Diaconis: Shuffling cards and stopping times, Amer. Math. Monthly 93 (1986), 333–348.
D. Bayer & P. Diaconis: Trailing the dovetail shuffle to its lair, Annals Applied Probability 2 (1992), 294–313.
E. Behrends: Introduction to Markov Chains, Vieweg, Braunschweig/ Wiesbaden 2000.
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.
M. Gardner: Mathematical Magic Show, Knopf, New York/Allen & Unwin, London 1977.
E. N. Gilbert: Theory of Shuffl ing, Technical Memorandum, Bell Laboratories, Murray Hill NJ, 1955.
Author information
Authors and Affiliations
Rights 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