# Total variation distance and the Erdős–Turán law for random permutations with polynomially growing cycle weights

@inproceedings{Storm2014TotalVD,
title={Total variation distance and the Erdős–Tur{\'a}n law for random permutations with polynomially growing cycle weights},
author={Jesper Storm and Dirk Zeindler},
year={2014}
}
We study the model of random permutations of $n$ objects with polynomially growing cycle weights, which was recently considered by Ercolani and Ueltschi, among others. Using saddle-point analysis, we prove that the total variation distance between the process which counts the cycles of size $1, 2, ..., b$ and a process $(Z_1, Z_2, ..., Z_b)$ of independent Poisson random variables converges to $0$ if and only if $b=o(\ell)$ where $\ell$ denotes the length of a typical cycle in this model. By… CONTINUE READING

## The order of large random permutations with cycle weights

VIEW 5 EXCERPTS
HIGHLY INFLUENCED

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

## Cycle structure of random permutations with cycle weights

• Random Struct. Algorithms
• 2014

## Mod-Gaussian convergence and the value distribution of ζ(½ + it) and related quantities

• J. London Math. Society
• 2012