# Ewens's sampling formula

In population genetics, Ewens's sampling formula, introduced by Warren Ewens, states that under certain conditions (specified below), if a random sample of n gametes is taken from a population and classified according to the gene at a particular locus then the probability that there are a1 alleles represented once in the sample, and a2 alleles represented twice, and so on, is

$\operatorname {Pr} (a_{1},\dots ,a_{n})={n! \over \theta (\theta +1)\cdots (\theta +n-1)}\prod _{j=1}^{n}{\theta ^{a_{j}} \over j^{a_{j}}a_{j}!},$ for some positive number $\theta$ , whenever a1, ..., an is a sequence of nonnegative integers such that

$a_{1}+2a_{2}+3a_{3}+\cdots +na_{n}=n.\,$ The phrase "under certain conditions", used above, must of course be made precise. The assumptions are (1) the sample size n is small by comparison to the size of the whole population, and (2) the population is in statistical equilibrium under mutation and genetic drift and the role of selection at the locus in question is negligible, and (3) every mutant allele is novel. (See also idealised population.)

This is a probability distribution on the set of all partitions of the integer n. Among probabilists and statisticians it is often called the Ewens distribution.

When $\theta =0,$ the probability is 1 that all n genes are the same. When $\theta =1$ , then the distribution is precisely that of the integer partition induced by a uniformly distributed random permutation. As $\theta \rightarrow \infty ,$ the probability that no two of the n genes are the same approaches 1.

This family of probability distributions enjoys the property that if after the sample of n is taken, m of the n gametes are chosen without replacement, then the resulting probability distribution on the set of all partitions of the smaller integer m is just what the formula above would give if m were put in place of n.

The Ewens distribution arises naturally from the Chinese restaurant process. 