The mixing time of the Thorp shuffle

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 403-412

  Morris, Ben ^a,b  

^a INDIANA UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Markov chain; Martingale; MCMC; Mixing time

Indexed keywords

MARKOV PROCESSES;

MARKOV CHAIN; MARTINGALE; MCMC; MIXING TIME;

POLYNOMIAL APPROXIMATION;

EID: 34848857060     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060651     Document Type: Conference Paper

References (9)

1. Bayer, D. and Diaconis, P. Tracing the dovetail shuffle to its lair, Annals of Applied Probability. 2 (1992). pp. 294-313.
2. Çam, H. Rearrangeability of (2n - 1)-Stage Shuffle-Exchange Networks. SIAM Journal on Computing. 32 (2003). pp. 557-585.
3. Diaconis, P. Personal Communication.
4. Diaconis, P. Group representations in Probability and Statistics, volume 11 of Lecture Notes-Monograph series. Institute of Mathematical Statistics, Hayward, California, 1988.
5. Diaconis, P. and Fill, J. Strong stationary times via a new form of duality. Annals of Probability 18 (1990). pp. 1483-1522.
6. Knuth, D. Searching and Sorting, The Art of Computer Programming III. Addison-Wesley, 1973.
7. Morris, B. The mixing time for simple exclusion. To appear in Annals of Applied Probability.
8. Morris, B. and Peres, Y. Evolving sets, mixing and heat kernel bounds. To appear in Probability Theory and Related Fields. Availible at http://front.math.ucdavis.edu/math.PR/0305349.
9. Thorp, E. Nonrandom shuffling with applications to the game of Faro, Journal of the American Statistical Association. 68 (1973). pp. 842-847.