# A rule of thumb for riffle shuffling

```@article{Assaf2009ARO,
title={A rule of thumb for riffle shuffling},
author={Sami H. Assaf and Persi Diaconis and Kannan Soundararajan},
journal={Annals of Applied Probability},
year={2009},
volume={21},
pages={843-875}
}```
• Published 24 August 2009
• Mathematics
• 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

• Mathematics
• 2009
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

### Riffle shuffles with biased cuts

• Mathematics
• 2011
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 cut

### 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 it

### CLUMPY RIFFLE SHUFFLES

• Mathematics, Computer Science
• 2011
This paper develops an alternative family of clumpy shuffles, and analyzes their convergence rate, providing empirical evidence that their alternative shuffles converge at a similar rate as the clumpy riffle shuffle in cases that apply to real shuffling problems.

### A Better Way to Deal the Cards

• Mathematics, Engineering
Am. Math. Mon.
• 2010
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.

### Comparing dealing methods with repeating cards

• Mathematics
• 2012
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 deck

### Analysis of casino shelf shuffling machines

• 2013
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 advice

### On the Joint Distribution of Descents and Signs of Permutations

• Mathematics
The Electronic Journal of Combinatorics
• 2021
We study the joint distribution of descents and sign for elements of the symmetric group and the hyperoctahedral group (Coxeter groups of types \$A\$ and \$B\$). For both groups, this has an application

### Carries, Shuffling, and an Amazing Matrix

• Mathematics
Am. Math. Mon.
• 2009
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.

### Shuffling cards by spatial motion

• Mathematics
Stochastic Processes and their Applications
• 2022

## References

SHOWING 1-10 OF 41 REFERENCES

### Trailing the Dovetail Shuffle to its Lair

• Mathematics
• 1992
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 bounds

### The cutoff phenomenon for randomized riffle shuffles

• Mathematics
Random Struct. Algorithms
• 2008
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. © 2007

### MATHEMATICAL DEVELOPMENTS FROM THE ANALYSIS OP RIFFLE SHUFFLING

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 sharp

### Riffle shuffles of decks with repeated cards

• Mathematics
• 2006
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 either

### Riffle shuffles, cycles, and descents

• Mathematics
Comb.
• 1995
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.

### Shuffling cards for blackjack, bridge, and other card games

• Mathematics
• 2006
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 descent

### Carries, Shuffling, and an Amazing Matrix

• Mathematics
Am. Math. Mon.
• 2009
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.

### No-feedback card guessing for dovetail shuffles

It is shown that for k 2 log 2 (2n) + 1 the best strategy is to guess card 1 for the rst half of the deck and card 2n for the second half, indicating that the deck must be given k dovetail shuues to obtain a well mixed deck.

### 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.

### Normal Approximations for Descents and Inversions of Permutations of Multisets

• Mathematics
• 2005
Abstract Normal approximations for descents and inversions of permutations of the set {1,2,…,n} are well known. We consider the number of inversions of a permutation π(1),π(2),…,π(n) of a multiset