Random permutations with logarithmic cycle weights

@article{Robles2018RandomPW,
  title={Random permutations with logarithmic cycle weights},
  author={Nicolas Robles and Dirk Zeindler},
  journal={arXiv: Probability},
  year={2018}
}
We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study the asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables and also compute the total variation distance between both processes. Next, we prove a central limit theorem for the total number of cycles. Furthermore we establish a shape theorem and a functional central limit theorem for the Young diagrams associated… 

Figures from this paper

Multiplicative arithmetic functions and the generalized Ewens measure
Random integers, sampled uniformly from [1 , x ], share similarities with random permutations, sampled uniformly from S n . These similarities include the Erd˝os-Kac theorem on the distribution of
Long cycle of random permutations with polynomially growing cycle weights
TLDR
The asymptotic behaviour of the long cycles under a multiplicative measure with polynomial growing cycle weights is determined and it is proved that the cumulative cycle numbers converge in the region of theLong cycles to a Poisson process.
A new approach to the characteristic polynomial of a random unitary matrix
Since the seminal work of Keating and Snaith, the characteristic polynomial of a random Haar-distributed unitary matrix has seen several of its functional studied or turned into a conjecture; for
Limit Shapes for Gibbs Partitions of Sets
This study extends a prior investigation of limit shapes for partitions of integers, which was based on analysis of sums of geometric random variables. Here we compute limit shapes for grand
Multiplicative arithmetic functions and the Ewens measure
Random integers, sampled uniformly from $[1,x]$, share similarities with random permutations, sampled uniformly from $S_n$. These similarities include the Erd\H{o}s-Kac theorem on the distribution of
N T ] 2 S ep 2 01 9 Multiplicative arithmetic functions and the Ewens measure
Random integers, sampled uniformly from [1, x], share similarities with random permutations, sampled uniformly from Sn. These similarities include the Erdős-Kac theorem on the distribution of the

References

SHOWING 1-10 OF 23 REFERENCES
The limit shape of random permutations with polynomially growing cycle weights
In this work we are considering the behaviour of the limit shape of Young diagrams associated to random permutations on the set {1, . . . , n} under a particular class of multiplicative measures with
The generalized weighted probability measure on the symmetric group and the asymptotic behavior of the cycles
The goal of this paper is to analyse the asymptotic behaviour of the cycle process and the total number of cycles of weighted and generalized weighted random permutations which are relevant models in
Total variation distance and the Erd\H{o}s-Tur\'an law for random permutations with polynomially growing cycle weights
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
Random permutations without macroscopic cycles
We consider uniform random permutations of length n conditioned to have no cycle longer than nβ with 0 < β < 1, in the limit of large n. Since in unconstrained uniform random permutations most of the
Asymptotic Statistics of Cycles in Surrogate-Spatial Permutations
We propose an extension of the Ewens measure on permutations by choosing the cycle weights to be asymptotically proportional to the degree of the symmetric group. This model is primarily motivated by
Cycle structure of random permutations with cycle weights
TLDR
It is found that the typical cycle lengths, the total number of cycles, and the number of finite cycles in random permutations whose probability involves cycle weights are usually independent Poisson random variables.
Logarithmic Combinatorial Structures: A Probabilistic Approach
The elements of many classical combinatorial structures can be naturally decomposed into components. Permutations can be decomposed into cycles, polynomials over a finite field into irreducible
A functional central limit theorem for the Ewens sampling formula
  • J. Hansen
  • Mathematics
    Journal of Applied Probability
  • 1990
For each n > 0, the Ewens sampling formula from population genetics is a measure on the set of all partitions of the integer n. To determine the limiting distributions for the part sizes of a
Random permutations with cycle weights.
We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows
Polynomial Partition Asymptotics
...
...