arXiv Analytics

Sign in

arXiv:math/0507307 [math.PR]AbstractReferencesReviewsResources

The mixing time of the Thorp shuffle

Ben Morris

Published 2005-07-15Version 1

The Thorp shuffle is defined as follows. Cut the deck into two equal piles. Drop the first card from the left pile or the right pile according to the outcome of a fair coin flip; then drop from the other pile. Continue this way until both piles are empty. We show that the mixing time for the Thorp shuffle with $2^d$ cards is polynomial in $d$.

Comments: 21 pages
Categories: math.PR
Subjects: 60J10
Related articles: Most relevant | Search more
arXiv:0912.2759 [math.PR] (Published 2009-12-14)
Improved mixing time bounds for the Thorp shuffle
arXiv:2001.04166 [math.PR] (Published 2020-01-13)
A polynomial upper bound for the mixing time of edge rotations on planar maps
arXiv:1108.0133 [math.PR] (Published 2011-07-31, updated 2013-04-27)
Mixing times are hitting times of large sets