A rule of thumb for riffle shuffling

Abstract

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.

27 pages, 5 tables

References in corpus (2)

• Riffle shuffles of decks with repeated cards
• Shuffling cards for blackjack, bridge, and other card games

Cited by in corpus (6)

• Hopf algebras and Markov chains: Two examples and a theory
• Analysis of casino shelf shuffling machines
• Lumpings of Algebraic Markov Chains arise from Subquotients
• Functions of random walks on hyperplane arrangements
• Coupling for features of random walks
• Random walks on hyperplane arrangements and stopping times