Cycle structure of random permutations with cycle weights

We investigate the typical cycle lengths, the total number of cycles, and the number of finite cycles in random permutations whose probability involves cycle weights. Typical cycle lengths and total number of cycles depend strongly on the parameters, while the distributions of finite cycles are usually independent Poisson random variables.Comment: 22 pages, 2 figure

Large cycles and a functional central limit theorem for generalized weighted random permutations

The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend some classical results to a more general weighted probability measure which is a natural extension of the Ewens measure and which in particular allows to consider sets $A_n$ depending on the degree $n$ of the permutation. By means of complex analysis arguments and under reasonable conditions on generating functions we study the asymptotic behaviour of classical statistics. More precisely, we generalize results concerning large cycles of random permutations by Vershik, Shmidt and Kingman, namely the weak convergence of the size ordered cycle length to a Poisson-Dirichlet distribution. Furthermore, we apply our tools to the cycle counts and obtain a Brownian motion central limit theorem which extends results by DeLaurentis, Pittel and Hansen.Comment: 24 pages, 3 Figure

The limit shape of random permutations with polynomially growing cycle weights

In this work we are considering the behavior of the limit shape of Young diagrams associated to random permutations on the set $\{1,\dots,n\}$ under a particular class of multiplicative measures. Our method is based on generating functions and complex analysis (saddle point method). We show that fluctuations near a point behave like a normal random variable and that the joint fluctuations at different points of the limiting shape have an unexpected dependence structure. We will also compare our approach with the so-called randomization of the cycle counts of permutations and we will study the convergence of the limit shape to a continuous stochastic process.Comment: 36 pages, 3 figures. The paper was subject to a major revision (compared to v1): 1) we considered more general weights, i. e. $\theta_m= (\log m)^j m^\alpha$, 2) title replaced, 3) improvements of the presentation, 4) correction of typos and minor mathematical error

The Characteristic Polynomial of a Random Permutation Matrix at Different Points

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show that the behavior at different points is independent in the limit and are asymptotically normal. Our methods enables us to study more general matrices, closely related to permutation matrices, and multiplicative class functions.Comment: 30 pages, 2 figures. Differences to Version 1: We have improved the presentation and add some references Stochastic Processes and their Applications, 201

Random permutation matrices under the generalized Ewens measure

We consider a generalization of the Ewens measure for the symmetric group, calculating moments of the characteristic polynomial and similar multiplicative statistics. In addition, we study the asymptotic behavior of linear statistics (such as the trace of a permutation matrix or of a wreath product) under this new measure.Comment: Published in at http://dx.doi.org/10.1214/12-AAP862 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

The order of large random permutations with cycle weights

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to Erd\"os and Tur\'an who proved in 1965 that $\log O_n$ satisfies a central limit theorem. We extend this result to the so-called \textit{generalized Ewens measure} in a previous paper. In this paper, we establish a local limit theorem as well as, under some extra moment condition, a precise large deviations estimate. These properties are new even for the uniform measure. Furthermore, we provide precise large deviations estimates for random permutations with polynomial cycle weights.Comment: 41 pages, 5 figure