On the rate of approximation in finite-alphabet longest increasing subsequence problems
From MaRDI portal
Publication:1931327
DOI10.1214/12-AAP853zbMath1261.60012arXiv0911.4917OpenAlexW3105334403MaRDI QIDQ1931327
Christian Houdré, Zsolt Talata
Publication date: 25 January 2013
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4917
Gaussian processes (60G15) Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Sample path properties (60G17) Asymptotic enumeration (05A16)
Related Items (1)
Cites Work
- Asymptotics for random Young diagrams when the word length and alphabet size simultaneously grow to infinity
- Approximation of the distribution of the supremum of a centered random walk. Application to the local score
- Departures from many queues in series
- On the longest increasing subsequence for finite and countable alphabets
- An approximation of partial sums of independent RV's, and the sample DF. II
- An approximation of partial sums of independent RV'-s, and the sample DF. I
- An application of Fourier methods to the problem of sharpening the Berry-Esseen inequality
- GUEs and queues
- Discrete orthogonal polynomial ensembles and the Plancherel measure
- Random words, Toeplitz determinants and integrable systems. II
- Limit theorems for height fluctuations in a class of discrete space and time growth models
- On the distributions of the lengths of the longest monotone subsequences in random words
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the rate of approximation in finite-alphabet longest increasing subsequence problems
