Abstract
One of the most important applications of group representation theory is to probability and statistics, via the study of random walks on groups. In a famous paper [1], Bayer and Diaconis gave very precise estimates on how many riffle shuffles it takes to randomize a deck of n cards; the riffle shuffle is the shuffle where you cut the pack of cards into two halves and then interleave them. Bayer and Diaconis concluded based on their results that, for a deck of 52 cards, seven riffle shuffles are enough. Any fewer shuffles are too far from being random, whereas the net gain in randomness for doing more than seven shuffles is not sufficient to warrant the extra shuffles.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Some authors use a different convention to relate permutations to shuffles and hence use a different definition of rising sequence. We follow  [7].
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Steinberg, B. (2012). Probability and Random Walks on Groups. In: Representation Theory of Finite Groups. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0776-8_11
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0776-8_11
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-0775-1
Online ISBN: 978-1-4614-0776-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)