A rule of thumb for riffle shuffling

10Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

We study how many riffle shuffles are required to mix n cards if only certain features of the deck are of interest, for example, suits disregarded or only the colors of interest. For these features the number of shuffles drops from 3/2 log2n to log2n. We derive closed formulae and an asymptotic "rule of thumb" formula which is remarkably accurate. © Institute of Mathematical Statistics, 2011.

References Powered by Scopus

On choosing and bounding probability metrics

838Citations
N/AReaders
Get full text

Generating a random permutation with random transpositions

409Citations
N/AReaders
Get full text

Strong uniform times and finite random walks

157Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Hopf algebras and Markov chains: Two examples and a theory

15Citations
N/AReaders
Get full text

Analysis of casino shelf shuffling machines

15Citations
N/AReaders
Get full text

On the joint distribution of descents and signs of permutations

6Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Assaf, S., Diaconis, P., & Soundararajan, K. (2011). A rule of thumb for riffle shuffling. Annals of Applied Probability, 21(3), 843–875. https://doi.org/10.1214/10-AAP701

Readers over time

‘10‘11‘12‘15‘16‘2000.751.52.253

Readers' Seniority

Tooltip

Professor / Associate Prof. 4

67%

PhD / Post grad / Masters / Doc 1

17%

Researcher 1

17%

Readers' Discipline

Tooltip

Mathematics 5

50%

Computer Science 3

30%

Agricultural and Biological Sciences 1

10%

Engineering 1

10%

Article Metrics

Tooltip
Mentions
References: 3

Save time finding and organizing research with Mendeley

Sign up for free
0