Monotonous subsequences and the descent process of invariant random permutations

DOI10.1214/18-EJP244zbMATH Open1406.60018arXiv1805.05253MaRDI QIDQ1722013FDOQ1722013

Authors: Mohamed Slim Kammoun 

Publication date: 14 February 2019

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: It is known from the work of Baik, Deift, and Johansson [1999] that we have Tracy-Widom fluctuations for the longest increasing subsequence of uniform permutations. In this paper, we prove that this result holds also in the case of the Ewens distribution and more generally for a class of random permutation with distribution invariant under conjugation. Moreover, we obtain the convergence of the first components of the associated Young tableaux to the Airy Ensemble as well as the global convergence to the Vershik-Kerov-Logan-Shepp shape. Using similar techniques, we also prove that the limiting descent process of a large class of random permutations is stationary, one-dependent and determinantal.

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

Recommendations

• The asymptotics of monotone subsequences of involutions
• On the distribution of the length of the longest increasing subsequence of random permutations
• Permutations without long decreasing subsequences and random matrices
• Descending subsequences of random permutations
• On the longest common subsequence of conjugation invariant random permutations

zbMATH Keywords

determinantal point processeslongest increasing subsequenceTracy-Widom distributionrandom permutationsRobinson-Schensted correspondencedescent process

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Cites Work

• The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator
• The coincidence approach to stochastic point processes
• Level-spacing distributions and the Airy kernel
• Permutations, matrices, and generalized Young tableaux
• The Kardar-Parisi-Zhang equation and universality class
• Title not available (Why is that?)
• Longest Increasing and Decreasing Subsequences
• Title not available (Why is that?)
• On the distribution of the length of the longest increasing subsequence of random permutations
• Lectures on integrable probability
• Title not available (Why is that?)
• Course 1 Random matrices and determinantal processes
• Random Fragmentation and Coagulation Processes
• Transition probabilities for continual Young diagrams and the Markov moment problem
• Logarithmic combinatorial structures: A probabilistic approach
• The sampling theory of selectively neutral alleles
• Title not available (Why is that?)
• A variational problem for random Young tableaux
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotics of Plancherel measures for symmetric groups
• Discrete orthogonal polynomial ensembles and the Plancherel measure
• Descent sets of cyclic permutations
• École d'été de probabilités de Saint-Flour XIII - 1983
• Asymptotics of maximal and typical dimensions of irreducible representations of a symmetric group
• Title not available (Why is that?)
• On adding a list of numbers (and other one-dependent determinantal processes)
• The length of the longest increasing subsequence of a random Mallows permutation
• Title not available (Why is that?)
• Cycle structure of random permutations with cycle weights
• Random partitions in population genetics
• An extension of Schensted's theorem
• On the Asymptotic Distribution of Large Prime Factors
• Title not available (Why is that?)
• Stationary Random Partitions of Positive Integers
• Extreme value distributions for random coupon collector and birthday problems

Cited In (7)

• Universality for random permutations and some other groups
• Statistical enumeration of groups by double cosets
• The asymptotics of monotone subsequences of involutions
• Monotone subsequences in locally uniform random permutations
• On the longest common subsequence of conjugation invariant random permutations
• A product of invariant random permutations has the same small cycle structure as uniform
• Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons

This page was built for publication: Monotonous subsequences and the descent process of invariant random permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722013)