On the rate of approximation in finite-alphabet longest increasing subsequence problems
View/ Open
Issue Date
2012-09-05Author
Houdre, Christian
Talata, Zsolt
Publisher
Institute of Mathematical Statistics
Type
Article
Article Version
Scholarly/refereed, publisher version
Metadata
Show full item recordAbstract
The rate of convergence of the distribution of the length of the longest increasing subsequence, toward the maximal eigenvalue of certain matrix ensembles, is investigated. For finite-alphabet uniform and nonuniform i.i.d. sources, a rate of logn/n√ is obtained. The uniform binary case is further explored, and an improved 1/n√ rate obtained.
Description
This is the published version, also available here: http://dx.doi.org/10.1214/12-AAP853.
Collections
Citation
Houdré, Christian; Talata, Zsolt. On the rate of approximation in finite-alphabet longest increasing subsequence problems. Ann. Appl. Probab. 22 (2012), no. 6, 2539--2559. http://dx.doi.org/10.1214/12-AAP853.
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.