Lengths of monotone subsequences in a Mallows permutation

DOI10.1007/S00440-014-0559-7zbMath1323.60019arXiv1306.3674OpenAlexW1989633256MaRDI QIDQ2343030

Nayantara Bhatnagar, Ron Peled

Publication date: 4 May 2015

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3674

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Large deviations (60F10) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) (L^p)-limit theorems (60F25)

Related Items (27)

A view from the bridge spanning combinatorics and probability ⋮ Statistical enumeration of groups by double cosets ⋮ A central limit theorem for descents of a Mallows permutation and its inverse ⋮ Phase uniqueness for the Mallows measure on permutations ⋮ The band structure of a model of spatial random permutation ⋮ Mallows permutations and finite dependence ⋮ Cycles in Mallows random permutations ⋮ Permutations avoiding a pattern of length three under Mallows distributions ⋮ Regenerative random permutations of integers ⋮ Limit distributions for Euclidean random permutations ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ Monotone subsequences in locally uniform random permutations ⋮ Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions ⋮ Limit theorems for longest monotone subsequences in random Mallows permutations ⋮ Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons ⋮ Locally uniform random permutations with large increasing subsequences ⋮ Unnamed Item ⋮ Longest increasing path within the critical strip ⋮ Limits of Mallows trees ⋮ On the cycle structure of Mallows permutations ⋮ Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings ⋮ Thresholds for patterns in random permutations with a given number of inversions ⋮ Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences ⋮ The height of Mallows trees ⋮ Clustering of consecutive numbers in permutations under Mallows distributions and super-clustering under general \(p\)-shifted distributions ⋮ The limit of the empirical measure of the product of two independent Mallows permutations ⋮ Mallows permutations as stable matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The length of the longest increasing subsequence of a random Mallows permutation
• The two-sided infinite extension of the Mallows model for random permutations
• \(q\)-exchangeability via quasi-invariance
• A variational problem for random Young tableaux
• The representation theory of the symmetric groups
• GL(n, q) and increasing subsequences in non-uniform random permutations
• Limiting curves for i.i.d. records
• Asymptotics of \(q\)-Plancherel measures.
• A universality property for last-passage percolation paths close to the axis
• Permutations, matrices, and generalized Young tableaux
• NON-NULL RANKING MODELS. I
• Longest Increasing and Decreasing Subsequences
• Thermodynamic limit for the Mallows model on Sn
• On Increasing Subsequences of I.I.D. Samples
• On the distribution of the length of the longest increasing subsequence of random permutations
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• A remark on a theorem of Chatterjee and last passage percolation
• On the Representations of the Symmetric Group
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques

This page was built for publication: Lengths of monotone subsequences in a Mallows permutation