Mixing times of the biased card shuffling and the asymmetric exclusion process

Details Mixing times of the biased card shuffling and the asymmetric exclusion process Mixing times of the biased card shuffling and the asymmetric exclusion process

2002-07-22

arxiv.org/abs/math/0207199v2

Mathematics

Probability

22 pages. Minor changes in introduction

Scientific paper

Consider the following method of card shuffling. Start with a deck of $N$ cards numbered 1 through N. Fix a parameter $p$ between 0 and 1. In this model a ``shuffle'' consists of uniformly selecting a pair of adjacent cards and then flipping a coin that is heads with probability p. If the coin comes up heads then we arrange the two cards so that the lower numbered card comes before the higher numbered card. If the coin comes up tails then we arrange the cards with the higher numbered card first. In this paper we prove that for all p not equal to 1/2, the mixing time of this card shuffling is O(N^2), as conjectured by Diaconis and Ram [DR]. A novel feature of our proof is that the analysis of an infinite (asymmetric exclusion) process plays an essential role in bounding the mixing time of a finite process.

Affiliated with

Also associated with

No associations

Rating

Mixing times of the biased card shuffling and the asymmetric exclusion process 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 Mixing times of the biased card shuffling and the asymmetric exclusion process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mixing times of the biased card shuffling and the asymmetric exclusion process will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469311