The cutoff phenomenon for randomized riffle shuffles
- 4 September 2007
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 32 (3) , 346-374
Abstract
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 Wiley Periodicals, Inc. Random Struct. Alg., 2008Keywords
All Related Versions
Funding Information
- NCTS
- NSF (DMS0102126, 0306194, 0603886)
This publication has 11 references indexed in Scilit:
- Random Walks on Finite Groups2004
- Information Loss in Riffle ShufflingCombinatorics, Probability and Computing, 2002
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangementsDuke Mathematical Journal, 1999
- Random walks and hyperplane arrangementsThe Annals of Probability, 1998
- The cutoff phenomenon in finite Markov chains.Proceedings of the National Academy of Sciences, 1996
- Probability1996
- Analysis of Top To Random ShufflesCombinatorics, Probability and Computing, 1992
- Trailing the Dovetail Shuffle to its LairThe Annals of Applied Probability, 1992
- Strong uniform times and finite random walksAdvances in Applied Mathematics, 1987
- A probabilistic interpretation of Eulerian numbersDuke Mathematical Journal, 1973