Mixing Times of Self-Organizing Lists and Biased Permutations

Details Mixing Times of Self-Organizing Lists and Biased Permutations Mixing Times of Self-Organizing Lists and Biased Permutations

2012-04-15

arxiv.org/abs/1204.3239v1

Computer Science

Discrete Mathematics

21 pages

Scientific paper

Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \cal{M}}_{nn} is known to converge in time \Theta(n^3 \log n) in the uniform case and time \Theta(n^2) in the constant bias case, in which we put adjacent elements in order with probability p \neq 1/2 and out of order with probability 1-p. Here we consider the variable bias case where we put adjacent elements x

Affiliated with

Also associated with

No associations

Rating

Mixing Times of Self-Organizing Lists and Biased Permutations 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 Self-Organizing Lists and Biased Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mixing Times of Self-Organizing Lists and Biased Permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-287385