相关论文: Symmetrized random permutations

The notion of $r$-crossing and $r$-nesting of a complete matching was introduced and a symmetry property was proved by Chen et al. [Trans. Amer. Math. Soc. 359 (2007) 1555-1575]. We consider random matchings of large size and study their…

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…

Our interest is in the scaled joint distribution associated with $k$-increasing subsequences for random involutions with a prescribed number of fixed points. We proceed by specifying in terms of correlation functions the same distribution…

A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…

We study the limiting behavior of smooth linear statistics of the spectrum of random permutation matrices in the mesoscopic regime, when the permutation follows one of the Ewens measures on the symmetric group. If we apply a smooth enough…

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

A possibly fruitful extension of conventional random matrix ensembles is proposed by imposing symmetry constraints on conventional Hermitian matrices or parity-time- (PT-) symmetric matrices. To illustrate the main idea, we first study 2*2…

The Mallows measure on the symmetric group $S_n$ is the probability measure such that each permutation has probability proportional to $q$ raised to the power of the number of inversions, where $q$ is a positive parameter and the number of…

We study the number of random permutations needed to invariably generate the symmetric group, $S_n$, when the distribution of cycle counts has the strong $\alpha$-logarithmic property. The canonical example is the Ewens sampling formula,…

In these lecture notes I will give a pedagogical introduction to some common aspects of 4 different problems: (i) random matrices (ii) the longest increasing subsequence problem (also known as the Ulam problem) (iii) directed polymers in…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

We consider random permutation matrices following a one-parameter family of deformations of the uniform distribution, called Ewens' measures, and modifications of these matrices where the entries equal to one are replaced by i.i.d uniform…

Using the recently developed notion of permutation limits this paper derives the limiting distribution of the number of fixed points and cycle structure for any convergent sequence of random permutations, under mild regularity conditions.…

We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…

One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix $A$ and storing the permutation matrix factor $P$ from the resulting GEPP factorization $PA=LU$. We are…

We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…

The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…

In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…