Limit theorems for longest monotone subsequences in random Mallows permutations

DOI10.1214/16-AIHP777zbMath1382.60018arXiv1601.02003OpenAlexW2963979034MaRDI QIDQ1700399

Riddhipratim Basu, Nayantara Bhatnagar

Publication date: 5 March 2018

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

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

zbMATH Keywords

central limit theoremlongest increasing subsequenceMallows permutations

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Related Items

Statistical enumeration of groups by double cosets ⋮ A central limit theorem for descents of a Mallows permutation and its inverse ⋮ First passage percolation on hyperbolic groups ⋮ Mallows permutations and finite dependence ⋮ Cycles in Mallows random permutations ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ Regenerative random permutations of integers ⋮ Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions ⋮ Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons ⋮ Poisson percolation on the square lattice ⋮ On the cycle structure of Mallows permutations ⋮ Block size in geometric(\(p\))-biased permutations ⋮ 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 ⋮ Arcsine laws for random walks generated from random permutations with applications to genomics ⋮ Mallows permutations as stable matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The length of the longest increasing subsequence of a random Mallows permutation
• Central limit theorem for first-passage percolation time across thin cylinders
• The two-sided infinite extension of the Mallows model for random permutations
• \(q\)-exchangeability via quasi-invariance
• Current fluctuations for TASEP: A proof of the Prähofer-Spohn conjecture
• Metric methods for analyzing partially ranked data
• Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
• A variational problem for random Young tableaux
• On the cycle structure of Mallows permutations
• The asymptotics of monotone subsequences of involutions
• On the distribution of the largest eigenvalue in principal components analysis
• Limiting curves for i.i.d. records
• Hammersley's interacting particle process and longest increasing subsequences
• Lengths of monotone subsequences in a Mallows permutation
• Permutations, matrices, and generalized Young tableaux
• Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
• A central limit theorem for the length of the longest common subsequences in random words
• On adding a list of numbers (and other one-dependent determinantal processes)
• NON-NULL RANKING MODELS. I
• Longest Increasing and Decreasing Subsequences
• Basics of Applied Stochastic Processes
• 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
• Phase uniqueness for the Mallows measure on permutations
• Mixing times of the biased card shuffling and the asymmetric exclusion process
• On the Representations of the Symmetric Group
• Probability: A Graduate Course
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques