Mixing times for random k-cycles and coalescence-fragmentation chains

Details Mixing times for random k-cycles and coalescence-fragmentation chains Mixing times for random k-cycles and coalescence-fragmentation chains

2010-01-12

arxiv.org/abs/1001.1894v3

Annals of Probability 2011, Vol. 39, No. 5, 1815-1843

Mathematics

Probability

Published in at http://dx.doi.org/10.1214/10-AOP634 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of

Scientific paper

10.1214/10-AOP634

Let $\mathcal{S}_n$ be the permutation group on $n$ elements, and consider a random walk on $\mathcal{S}_n$ whose step distribution is uniform on $k$-cycles. We prove a well-known conjecture that the mixing time of this process is $(1/k)n\log n$, with threshold of width linear in $n$. Our proofs are elementary and purely probabilistic, and do not appeal to the representation theory of $\mathcal{S}_n$.

Affiliated with

Also associated with

No associations

Rating

Mixing times for random k-cycles and coalescence-fragmentation chains 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 for random k-cycles and coalescence-fragmentation chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mixing times for random k-cycles and coalescence-fragmentation chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-459351