Riffle shuffles of a deck with repeated cards
From MaRDI portal
Publication:3176558
zbMATH Open1391.60014arXiv0905.4698MaRDI QIDQ3176558FDOQ3176558
Authors: Sami Assaf, Persi Diaconis, Kannan Soundararajan 
Publication date: 23 July 2018
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/0905.4698
Recommendations
Permutations, words, matrices (05A05) Combinatorial probability (60C05) Symmetric groups (20B30) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)
Cited In (8)
- The Monge shuffle for two-power decks
- Riffle shuffles of decks with repeated cards
- An absorbing version of the top-to-random shuffle
- Classes of equally likely outcomes of a riffle shuffle on a deck of alternating cards
- Title not available (Why is that?)
- Non-random shuffling for multiple decks
- A rule of thumb for riffle shuffling
- How many shuffles to randomize a deck of cards?
This page was built for publication: Riffle shuffles of a deck with repeated cards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176558)
