arXiv Analytics

Sign in

arXiv:1811.02039 [math.PR]AbstractReferencesReviewsResources

Random walks generated by Ewens distribution on the symmetric group

Alperen Y. Özdemir

Published 2018-11-05Version 1

This paper studies Markov chains on the symmetric group $S_n$ where the transition probabilities are given by Ewens distribution with parameter $\theta>0$. The eigenvalues are identified to be content polynomials of partitions divided by n$th$ rising factorial of $\theta.$ The mixing time analysis is carried out for two cases: If $\theta$ is a constant integer, the chain is fast enough that the mixing time does not depend on $n.$ If $\theta=n$, the chain exhibits a total variation cutoff at $\frac{\log n}{\log 2}$ steps.

Comments: 24 pages, 2 figures
Categories: math.PR
Subjects: 60C05, 05E10
Related articles: Most relevant | Search more
arXiv:math/0203177 [math.PR] (Published 2002-03-18, updated 2002-09-26)
A path-transformation for random walks and the Robinson-Schensted correspondence
arXiv:math/0503089 [math.PR] (Published 2005-03-05)
Random walks in a random environment
arXiv:1206.5182 [math.PR] (Published 2012-06-22, updated 2013-03-06)
A local limit theorem for random walks in balanced environments