Moderate deviations for longest increasing subsequences: The upper tail
DOI10.1002/cpa.10010zbMath1033.60035OpenAlexW2910132772MaRDI QIDQ4790262
Publication date: 28 January 2003
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/moderate-deviations-for-longest-increasing-subsequences--the-upper-tail(6d2af7a1-bed9-49d5-b15c-e575021c7f61).html
random permutationmoderate deviationsRiemann-Hilbert problemsUlam's problemsaddle point approximation
Permutations, words, matrices (05A05) Combinatorial probability (60C05) Large deviations (60F10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (19)
Cites Work
- Unnamed Item
- Unnamed Item
- Symmetric functions and P-recursiveness
- The longest increasing subsequence in a random permutation and a unitary random matrix model
- Discrete Painlevé equations and their appearance in quantum gravity
- A variational problem for random Young tableaux
- Large deviations for increasing sequences on the plane
- Level-spacing distributions and the Airy kernel
- Ulam's problem and Hammersley's process
- Hammersley's interacting particle process and longest increasing subsequences
- On Increasing Subsequences of I.I.D. Samples
- 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: Moderate deviations for longest increasing subsequences: The upper tail