Random generation under the Ewens distribution

TL;DR

This paper investigates the properties of permutations generated under the Ewens distribution, showing how many permutations are needed to generate the alternating group with high probability depending on the parameter .

Contribution

It provides new bounds on the number of Ewens-distributed permutations required to generate the alternating group as  varies with n.

Findings

Two permutations suffice for small , up to n^{1/2}.

Three permutations are needed when  is between n^{1/2} and n^{2/3}.

The required number of permutations increases with .

Abstract

The Ewens sampling formula with parameter $\alpha$ is the distribution on $S_n$ which gives each $\pi\in S_n$ weight proportional to $\alpha^{C(\pi)}$, where $C(\pi)$ is the number of cycles of $\pi$. We show that, for any fixed $\alpha$, two Ewens-random permutations generate at least $A_n$ with high probability. More generally we work out how many permutations are needed for $\alpha$ growing with $n$. Roughly speaking, two are needed for $0 \leq \alpha \ll n^{1/2}$, three for $n^{1/2} \ll \alpha \ll n^{2/3}$, etc.