When the law of large numbers fails for increasing subsequences of random permutations

DOI10.1214/009117906000000728zbMath1124.60033arXivmath/0604067OpenAlexW2054885235MaRDI QIDQ2371955

Ross G. Pinsky

Publication date: 9 July 2007

Published in: The Annals of Probability (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial probability (60C05) Limit theorems in probability theory (60F99)

Related Items (1)

Asymptotic results on weakly increasing subsequences in random words

Cites Work

• Asymptotics of maximal and typical dimensions of irreducible representations of a symmetric group
• A variational problem for random Young tableaux
• Law of large numbers for increasing subsequences of random permutations
• 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

This page was built for publication: When the law of large numbers fails for increasing subsequences of random permutations