Improved mixing time bounds for the Thorp shuffle

Details Improved mixing time bounds for the Thorp shuffle Improved mixing time bounds for the Thorp shuffle

2009-12-14

arxiv.org/abs/0912.2759v1

Mathematics

Probability

8 pages

Scientific paper

E. Thorp introduced the following card shuffling model. Suppose the number of cards $n$ is even. Cut the deck into two equal piles. Drop the first card from the left pile or from 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 if $n$ is a power of 2 then the mixing time of the Thorp shuffle is $O(\log^3 n)$. Previously, the best known bound was $O(\log^4 n)$.

Affiliated with

Also associated with

No associations

Rating

Improved mixing time bounds for the Thorp shuffle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved mixing time bounds for the Thorp shuffle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved mixing time bounds for the Thorp shuffle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-304413