Asymptotics for the Length of the Longest Increasing Subsequence of a Binary Markov Random Word
From MaRDI portal
Publication:2841798
DOI10.1007/978-1-4614-5906-4_23zbMath1281.60066arXiv1110.1324OpenAlexW56402619MaRDI QIDQ2841798
Trevis J. Litherland, Christian Houdré
Publication date: 30 July 2013
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.1324
functional central limit theoremMarkov chainsrandom matricesYoung diagramslongest increasing subsequence
Brownian motion (60J65) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Functional limit theorems; invariance principles (60F17)
Related Items (1)
This page was built for publication: Asymptotics for the Length of the Longest Increasing Subsequence of a Binary Markov Random Word