Monotonous subsequences and the descent process of invariant random permutations

DOI10.1214/18-EJP244zbMath1406.60018arXiv1805.05253MaRDI QIDQ1722013

Mohamed Slim Kammoun

Publication date: 14 February 2019

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

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

zbMATH Keywords

Robinson-Schensted correspondenceTracy-Widom distributiondeterminantal point processeslongest increasing subsequencerandom permutationsdescent process

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (5)

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

Cites Work

• 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
• 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
• An extension of Schensted's theorem
• A variational problem for random Young tableaux
• Level-spacing distributions and the Airy kernel
• Transition probabilities for continual Young diagrams and the Markov moment problem
• The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator
• Logarithmic combinatorial structures: A probabilistic approach
• Extreme value distributions for random coupon collector and birthday problems
• Permutations, matrices, and generalized Young tableaux
• The sampling theory of selectively neutral alleles
• Cycle structure of random permutations with cycle weights
• THE KARDAR–PARISI–ZHANG EQUATION AND UNIVERSALITY CLASS
• On adding a list of numbers (and other one-dependent determinantal processes)
• Longest Increasing and Decreasing Subsequences
• Course 1 Random matrices and determinantal processes
• The coincidence approach to stochastic point processes
• Random partitions in population genetics
• On the distribution of the length of the longest increasing subsequence of random permutations
• On the Asymptotic Distribution of Large Prime Factors
• Stationary Random Partitions of Positive Integers
• Lectures on integrable probability
• Asymptotics of Plancherel measures for symmetric groups
• Random Fragmentation and Coagulation Processes
• Discrete orthogonal polynomial ensembles and the Plancherel measure

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