相关论文: Symmetrized random permutations

We couple projective limits of probability measures to direct limits of their symmetry groups. We show that the direct limit group is the group of symmetries of the projective limit probability measure. If projective systems of probability…

We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…

We introduce and study the writhe of a permutation, a circular variant of the well-known inversion number. This simple permutation statistics has several interpretations, which lead to some interesting properties. For a permutation sampled…

We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…

We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…

It is now believed that the limiting distribution function of the largest eigenvalue in the three classic random matrix models GOE, GUE and GSE describe new universal limit laws for a wide variety of processes arising in mathematical…

We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

A feature of certain ensembles of random matrices is that the corresponding measure is invariant under conjugation by unitary matrices. Study of such ensembles realised by matrices with Gaussian entries leads to statistical quantities…

Spatial random permutations were originally studied due to their connections to Bose-Einstein condensation, but they possess many interesting properties of their own. For random permutations of a regular lattice with periodic boundary…

We present a random matrix interpretation of the distribution functions which have appeared in the study of the one-dimensional polynuclear growth (PNG) model with external sources. It is shown that the distribution, GOE$^2$, which is…

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

We study a certain random groeth model in two dimensions closely related to the one-dimensional totally asymmetric exclusion process. The results show that the shape fluctuations, appropriately scaled, converges in distribution to the…

We study the asymptotic behavior of short cycles of random permutations with cycle weights. More specifically, on a specially constructed metric space whose elements encode all possible cycles, we consider a point process containing all…

Symmetry -- invariance to certain operators -- is a fundamental concept in many branches of physics. We propose ways to measure symmetric properties of vertices, and their surroundings, in networks. To be stable to the randomness inherent…

We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…

Permutons, which are probability measures on the unit square $[0, 1]^2$ with uniform marginals, are the natural scaling limits for sequences of (random) permutations. We introduce a $d$-dimensional generalization of these measures for all…

We consider a directed graph on the 2-dimensional integer lattice, placing a directed edge from vertex $(i_1,i_2)$ to $(j_1,j_2)$, whenever $i_1 \le j_1$, $i_2 \le j_2$, with probability $p$, independently for each such pair of vertices.…

Random permutation set (RPS), as a recently proposed theory, enables powerful information representation by traversing all possible permutations. However, the repetition of items is not allowed in RPS while it is quite common in real life.…

For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…