Related papers: Classical patterns in Mallows permutations
Motivated by recent studies of large Mallows$(q)$ permutations, we propose a class of random permutations of $\mathbb{N}_{+}$ and of $\mathbb{Z}$, called regenerative permutations. Many previous results of the limiting Mallows$(q)$…
We introduce a probability distribution Q on the group of permutations of the set Z of integers. Distribution Q is a natural extension of the Mallows distribution on the finite symmetric group. A one-sided infinite counterpart of Q,…
We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…
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}…
We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…
We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of \emph{consecutive} pattern occurrences. We also characterize random limiting objects for this new topology introducing a…
We introduce and study a new random permutation model that generalizes the $k$-card minimum model defined by Travers and the Mallows model. We calculate the permuton limit of such a sequence of random permutations. As a corollary, we deduce…
In a recent work, a central limit theorem for pattern counts in random planar maps was proven by reducing the problem to a face count problem. We provide a shorter proof by circumventing this reduction through the computation of bivariate…
We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem,…
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…
The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…
In applications such as rank aggregation, mixture models for permutations are frequently used when the population exhibits heterogeneity. In this work, we study the widely used Mallows mixture model. In the high-dimensional setting, we…
We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…
Random binary search trees are obtained by recursively inserting the elements $\sigma(1),\sigma(2),\ldots,\sigma(n)$ of a uniformly random permutation $\sigma$ of $[n]=\{1,\dots,n\}$ into a binary search tree data structure. Devroye (1986)…
We give a new proof of the classical Central Limit Theorem, in the Mallows ($L^r$-Wasserstein) distance. Our proof is elementary in the sense that it does not require complex analysis, but rather makes use of a simple subadditive inequality…
We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…
We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…
Asymptotics of the normalizing constant is computed for a class of one parameter exponential families on permutations which includes Mallows model with Spearmans's Footrule and Spearman's Rank Correlation Statistic. The MLE, and a…
We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of…
Classical two-sample permutation tests for equality of distributions have exact size in finite samples, but they fail to control size for testing equality of parameters that summarize each distribution. This paper proposes permutation tests…