
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 means of this result, we prove a central limit theorem for the order of a permutation and thus extend the Erd��s-Tur��n Law to this measure. Furthermore, we prove a Brownian motion limit theorem for the small cycles.
Random permutations, Probability (math.PR), 510, 60C05, 60B15, 60F17, Total variation distance, Erdős–Turán law, 60F17, FOS: Mathematics, 60C05, Polynomially growing cycle weights, 60B15
Random permutations, Probability (math.PR), 510, 60C05, 60B15, 60F17, Total variation distance, Erdős–Turán law, 60F17, FOS: Mathematics, 60C05, Polynomially growing cycle weights, 60B15
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
