相关论文: Limit Theorems for the Length of the Longest Commo…

We study the lengths of monotone subsequences for permutations drawn from the Mallows measure. The Mallows measure was introduced by Mallows in connection with ranking problems in statistics. Under this measure, the probability of a…

The Mallows measure is a probability measure on $S_n$ where the probability of a permutation $\pi$ is proportional to $q^{l(\pi)}$ with $q > 0$ being a parameter and $l(\pi)$ the number of inversions in $\pi$. We prove a weak law of large…

We study the length of the longest increasing and longest decreasing subsequences of random permutations drawn from the Mallows measure. Under this measure, the probability of a permutation pi in S_n is proportional to q^{inv(pi)} where q…

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…

The Mallows measure is a probability measure on $S_n$ where the probability of a permutation $\pi$ is proportional to $q^{l(\pi)}$ with $q > 0$ being a parameter and $l(\pi)$ the number of inversions in $\pi$. We show the convergence of the…

We study the length of cycles of random permutations drawn from the Mallows distribution. Under this distribution, the probability of a permutation $\pi \in \mathbb{S}_n$ is proportional to $q^{\textrm{inv}(\pi)}$ where $0<q\le 1$ and…

We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patterns. The Mallows distribution behaves like a $q$-analogue of…

We study cycle counts in permutations of $1,\dots,n$ drawn at random according to the Mallows distribution. Under this distribution, each permutation $\pi \in S_n$ is selected with probability proportional to $q^{\text{inv}(\pi)}$, where…

Introduced by Mallows in statistical ranking theory, Mallows permutation model is a class of non-uniform probability measures on the symmetric group $S_n$ that depend on a distance metric $d(\sigma,\tau)$ on $S_n$ and a scale parameter…

For a positive number $q$ the Mallows measure on the symmetric group is the probability measure on $S_n$ such that $P_{n,q}(\pi)$ is proportional to $q$-to-the-power-$\mathrm{inv}(\pi)$ where $\mathrm{inv}(\pi)$ equals the number of…

This paper studies the asymptotic distribution of descents $\des(w)$ in a permutation $w$, and its inverse, distributed according to the Mallows measure. The Mallows measure is a non-uniform probability measure on permutations introduced to…

We study the statistics of the Mallows measure on permutations in the limit pioneered by Starr (2009). Our main result is the local central limit theorem for its height function. We also re-derive versions of the law of large numbers and…

Continuous-time Mallows processes are processes of random permutations of the set $\{1, \ldots, n\}$ whose marginal at time $t$ is the Mallows distribution with parameter $t$. Recently Corsini showed that there exists a unique Markov…

Let $A^{(n)}_{l;k}\subset S_n$ denote the set of permutations of $[n]$ for which the set of $l$ consecutive numbers $\{k, k+1,\cdots, k+l-1\}$ appears in a set of consecutive positions. Under the uniformly probability measure $P_n$ on…

We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $\mu$-random permutations. We also introduce and study a new general class of…

The Mallows model on $S_n$ is a probability distribution on permutations, $q^{d(\pi,e)}/P_n(q)$, where $d(\pi,e)$ is the distance between $\pi$ and the identity element, relative to the Coxeter generators. Equivalently, it is the number of…

A random permutation $\Pi_n$ of $\{1,\dots,n\}$ follows the $\DeclareMathOperator{\Mallows}{Mallows}\Mallows(n,q)$ distribution with parameter $q>0$ if $\mathbb{P} ( \Pi_n = \pi )$ is proportional to $\DeclareMathOperator{\inv}{inv}…

Let $P_{n,k}$ be the number of permutations $\pi$ on [n]={1, 2,..., n} such that the length of the longest increasing subsequences of $\pi$ equals k, and let $M_{2n, k}$ be the number of matchings on [2n] with crossing number k. Define…

We study classical pattern counts in Mallows random permutations with parameters $(n,q_n)$, as $n\to\infty$. We focus on three different regimes for the parameter $q = q_n$. When $n^{3/2}(1-q)\to0$, we use coupling techniques to prove that…

Mallows permutation model, introduced by Mallows in statistical ranking theory, is a class of non-uniform probability measures on the symmetric group $S_n$. The model depends on a distance metric $d(\sigma,\tau)$ on $S_n$, which can be…