Abstract
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
Citation
Christian Houdré. Zsolt Talata. "On the rate of approximation in finite-alphabet longest increasing subsequence problems." Ann. Appl. Probab. 22 (6) 2539 - 2559, December 2012. https://doi.org/10.1214/12-AAP853
Information