Lengths of monotone subsequences in a Mallows permutation
By Nayantara Bhatnagar, Ron Peled. 2013
70 citations recorded by the source corpus.
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 $$\uppi \in S_n$$π∈Sn is proportional to $$q^{\mathrm{Inv }(\uppi )}$$qInv(π) where $$q$$q is a real parameter and $$\mathrm{Inv }(\uppi )$$Inv(π) is the number of inversions in $$\uppi $$π. The case $$q=1$$q=1 corresponds to uniformly random permutations. The Mallows measure was introduced by Mallows in connection with ranking problems in statistics. We determine the typical order of magnitude of the lengths of the longest increasing and decreasing subsequences, as well as large deviation bounds for them. We also provide a simple bound on the variance of these lengths, and prove a law of large numbers for the length of the longest increasing subsequence. Assuming without loss of generality that $$q<1$$q<1, our results apply when $$q$$q is a function of $$n$$n satisfying $$n(1-q) \rightarrow \infty $$n(1-q)→∞. The case that $$n(1-q)=O(1)$$n(1-q)=O(1) was considered previously by Mueller and Starr. In our parameter range, the typical length of the longest increasing subsequence is of order $$n\sqrt{1-q}$$n1-q, whereas the typical length of the longest decreasing subsequence has four possible behaviors according to the precise dependence of $$n$$n and $$q$$q. We show also that in the graphical representation of a Mallows-distributed permutation, most points are found in a symmetric strip around the diagonal whose width is of order $$1/(1-q)$$1/(1-q). This suggests a connection between the longest increasing subsequence in the Mallows model and the model of last passage percolation in a strip.
Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/98cf16f059d52a4e54cb865265fda1d119a5d3f5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Discrete Mathematics and Combinatorics
In Statistics and Probability
Citations in the corpus
- On the Cycle Structure of Mallows Permutations (2016, background): “[13, 14] and the problem of the longest increasing subsequence [21, 6, 5].”