The Cycle Structure of Random Permutations

TLDR: In this paper, the authors give a simple upper bound on the total variation distance between a random permutation and an independent Poisson process and show that this distance decays to zero superexponentially fast as a function of n/b \rightarrow \infty.

Abstract: The total variation distance between the process which counts cycles of size $1,2,\ldots, b$ of a random permutation of $n$ objects and a process $(Z_1,Z_2,\ldots, Z_b)$ of independent Poisson random variables with $\mathbb{E}Z_i = 1/i$ converges to 0 if and only if $b/n \rightarrow 0$. This Poisson approximation can be used to give simple proofs of limit theorems and bounds for a wide variety of functionals of random permutations. These limit theorems include the Erdos-Turan theorem for the asymptotic normality of the log of the order of a random permutation, and the DeLaurentis-Pittel functional central limit theorem for the cycle sizes. We give a simple explicit upper bound on the total variation distance to show that this distance decays to zero superexponentially fast as a function of $n/b \rightarrow \infty$. A similar result holds for derangements and, more generally, for permutations conditioned to have given numbers of cycles of various sizes. Comparison results are included to show that in approximating the cycle structure by an independent Poisson process the main discrepancy arises from independence rather than from Poisson marginals.