Monotonous subsequences and the descent process of invariant random permutations
From MaRDI portal
Publication:1722013
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.
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
Cites work
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- scientific article; zbMATH DE number 989379 (Why is no real title available?)
- scientific article; zbMATH DE number 4217861 (Why is no real title available?)
- scientific article; zbMATH DE number 3718912 (Why is no real title available?)
- scientific article; zbMATH DE number 3518091 (Why is no real title available?)
- scientific article; zbMATH DE number 3630761 (Why is no real title available?)
- scientific article; zbMATH DE number 1303717 (Why is no real title available?)
- scientific article; zbMATH DE number 1957500 (Why is no real title available?)
- scientific article; zbMATH DE number 1857665 (Why is no real title available?)
- scientific article; zbMATH DE number 247174 (Why is no real title available?)
- A variational problem for random Young tableaux
- An extension of Schensted's theorem
- Asymptotics of Plancherel measures for symmetric groups
- Asymptotics of maximal and typical dimensions of irreducible representations of a symmetric group
- Course 1 Random matrices and determinantal processes
- Cycle structure of random permutations with cycle weights
- Descent sets of cyclic permutations
- Discrete orthogonal polynomial ensembles and the Plancherel measure
- Extreme value distributions for random coupon collector and birthday problems
- Lectures on integrable probability
- Level-spacing distributions and the Airy kernel
- Logarithmic combinatorial structures: A probabilistic approach
- Longest Increasing and Decreasing Subsequences
- On adding a list of numbers (and other one-dependent determinantal processes)
- On the Asymptotic Distribution of Large Prime Factors
- On the distribution of the length of the longest increasing subsequence of random permutations
- Permutations, matrices, and generalized Young tableaux
- Random Fragmentation and Coagulation Processes
- Random partitions in population genetics
- Stationary Random Partitions of Positive Integers
- The Kardar-Parisi-Zhang equation and universality class
- The coincidence approach to stochastic point processes
- The length of the longest increasing subsequence of a random Mallows permutation
- The sampling theory of selectively neutral alleles
- The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator
- Transition probabilities for continual Young diagrams and the Markov moment problem
- École d'été de probabilités de Saint-Flour XIII - 1983
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
- On the longest common subsequence of conjugation invariant random permutations
- Monotone subsequences in locally uniform 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)