Mathematics – Combinatorics
Scientific paper
2009-05-28
Mathematics
Combinatorics
11 pages; To appear in DMTCS as part of the conference proceedings for FPSAC 2009
Scientific paper
We study the Gilbert-Shannon-Reeds model for riffle shuffles and ask 'How many times must a deck of cards be shuffled for the deck to be in close to random order?'. In 1992, Bayer and Diaconis gave a solution which gives exact and asymptotic results for all decks of practical interest, e.g. a deck of 52 cards. But what if one only cares about the colors of the cards or disregards the suits focusing solely on the ranks? More generally, how does the rate of convergence of a Markov chain change if we are interested in only certain features? Our exploration of this problem takes us through random walks on groups and their cosets, discovering along the way exact formulas leading to interesting combinatorics, an 'amazing matrix', and new analytic methods which produce a completely general asymptotic solution that is remarkable accurate.
Assaf Sami
Diaconis Persi
Soundararajan Kannan
No associations
LandOfFree
Riffle shuffles of a deck with repeated cards does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Riffle shuffles of a deck with repeated cards, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Riffle shuffles of a deck with repeated cards will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-294588