A rule of thumb for riffle shuffling

  title={A rule of thumb for riffle shuffling},
  author={Sami H. Assaf and Persi Diaconis and Kannan Soundararajan},
  journal={Annals of Applied Probability},
We study how many riffle shuffles are required to mix n cards if only certain features of the deck are of interest, e.g. suits disregarded or only the colors of interest. For these features, the number of shuffles drops from 3/2 log_2(n) to log_2(n). We derive closed formulae and an asymptotic `rule of thumb' formula which is remarkably accurate. 

Tables from this paper

Riffle shuffles of a deck with repeated cards
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 aExpand
Riffle shuffles with biased cuts
The well-known Gilbert-Shannon-Reeds model for riffle shuffles assumes that the cards are initially cut 'about in half' and then riffled together. We analyze a natural variant where the initial cutExpand
Who would have thought card shuffling was so involved ?
In this paper we present some interesting mathematical results on card shuffling for two types of shuffling: the famous riffle shuffle and the random-to-top shuffle. A natural question is how long itExpand
Sticky or clumpy riffle shuffles appear quite naturally in applications; however, the problem of precisely describing the convergence rate of such modified riffle shuffles has remained open for aExpand
A Better Way to Deal the Cards
This work considers the case of decks with repeated cards and decks which are dealt into hands, as in bridge and poker, and derives asymptotic formulas for the randomness of the resulting games. Expand
Comparing dealing methods with repeating cards
In a recent work Conger and Howald derived asymptotic formulas for the randomness, after shuffling, of decks with repeating cards or all-distinct decks dealt into hands. In the latter case the deckExpand
Analysis of casino shelf shuffling machines
Many casinos routinely use mechanical card shuffling machines. We were asked to evaluate a new product, a shelf shuffler. This leads to new probability, new combinatorics and to some practical adviceExpand
Carries, Shuffling, and an Amazing Matrix
It is shown that this Markov chain has the same transition matrix as the descent process when a deck of cards is repeatedly riffle shuffled, giving new results for the statistics of carries and shuffling. Expand
Carries, shuffling, and symmetric functions
The ''carries'' when n random numbers are added base b form a Markov chain with an ''amazing'' transition matrix determined in a 1997 paper of Holte. This same Markov chain occurs in following theExpand
Partial mixing of semi-random transposition shuffles
We show that for any semi-random transposition shuffle on $n$ cards, the mixing time of any given $k$ cards is at most $n\log k$, provided $k=o((n/\log n)^{1/2})$. In the case of the top-to-randomExpand


Trailing the Dovetail Shuffle to its Lair
We analyze the most commonly used method for shuffling cards. The main result is a simple expression for the chance of any arrangement after any number of shuffles. This is used to give sharp boundsExpand
The cutoff phenomenon for randomized riffle shuffles
We study the cutoff phenomenon for generalized riffle shuffles where, at each step, the deck of cards is cut into a random number of packs of multinomial sizes which are then riffled together.
1. Introduction The most common method of mixing cards is the ordinary riffle shuffle, in which a deck of n cards (often n = 52) is cut into two parts and the parts are riffled together. A sharpExpand
Riffle shuffles of decks with repeated cards
By a well-known result of Bayer and Diaconis, the maximum entropy model of the common riffle shuffle implies that the number of riffle shuffles necessary to mix a standard deck of 52 cards is eitherExpand
Riffle shuffles, cycles, and descents
The theorems are derived from a bijection discovered by Gessel that allows new formulae and approximations for the number of permutations in a permutation with given cycle type and number of descents. Expand
Shuffling cards for blackjack, bridge, and other card games
This paper is about the following question: How many riffle shuffles mix a deck of card for games such as blackjack and bridge? An object that comes up in answering this question is the descentExpand
Carries, Shuffling, and an Amazing Matrix
It is shown that this Markov chain has the same transition matrix as the descent process when a deck of cards is repeatedly riffle shuffled, giving new results for the statistics of carries and shuffling. Expand
No-feedback card guessing for dovetail shuffles
We consider the following problem. A deck of 2n cards labeled consecutively from 1 on top to 2n on bottom is face down on the table. The deck is given k dovetail shuues and placed back on the table,Expand
A Card Shuffling Analysis of Deformations of the Plancherel Measure of the Symmetric Group
The main idea of this paper is to find and analyze a formula for the total variation distance between iterations of riffle shuffles and iterations of "cut and then riffle shuffle" to determine their convergence rate to randomness. Expand
EXAMPLE1. Top in at random shuffle. Consider the following method of mixing a deck of cards: the top card is removed and inserted into the deck at a random position. This procedure is repeated aExpand