On the limiting law of the length of the longest common and increasing subsequences in random words
arXiv:1505.06164 · doi:10.1016/j.spa.2016.09.005
Abstract
Let and be two sequences of independent and identically distributed (iid) random variables taking their values, uniformly, in a common totally ordered finite alphabet. Let LCI be the length of the longest common and (weakly) increasing subsequence of and . As grows without bound, and when properly centered and normalized, LCI is shown to converge, in distribution, towards a Brownian functional that we identify.
arXiv commentSome corrections from the published version are provided, some typos are also corrected
References in corpus (6)
- On the Distributions of the Lengths of the Longest Monotone Subsequences in Random Words
- Random Words, Toeplitz Determinants and Integrable Systems. II
- Limit Theorems for Height Fluctuations in a Class of Discrete Space and Time Growth Models
- A Central Limit Theorem for the Length of the Longest Common Subsequences in Random Words
- Asymptotics for random Young diagrams when the word length and alphabet size simultaneously grow to infinity
- GUE minors, maximal Brownian functionals and longest increasing subsequences