| dc.contributor.author | Houdre, Christian | |
| dc.contributor.author | Talata, Zsolt | |
| dc.date.accessioned | 2015-03-26T17:08:49Z | |
| dc.date.available | 2015-03-26T17:08:49Z | |
| dc.date.issued | 2012-09-05 | |
| dc.identifier.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. | en_US |
| dc.identifier.uri | http://hdl.handle.net/1808/17225 | |
| dc.description | This is the published version, also available here: http://dx.doi.org/10.1214/12-AAP853. | en_US |
| dc.description.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 logn/n√ is obtained. The uniform binary case is further explored, and an improved 1/n√ rate obtained. | en_US |
| dc.publisher | Institute of Mathematical Statistics | en_US |
| dc.subject | Longest increasing subsequence | en_US |
| dc.subject | Brownian functional | en_US |
| dc.subject | approximation | en_US |
| dc.subject | rate of convergence | en_US |
| dc.title | On the rate of approximation in finite-alphabet longest increasing subsequence problems | en_US |
| dc.type | Article | |
| kusw.kuauthor | Zsolt, Talata | |
| kusw.kudepartment | Mathematics | en_US |
| dc.identifier.doi | 10.1214/12-AAP853 | |
| kusw.oaversion | Scholarly/refereed, publisher version | |
| kusw.oapolicy | This item meets KU Open Access policy criteria. | |
| dc.rights.accessrights | openAccess | |
