Longest Increasing Subsequence for Finite Alphabets

SIAM Student Seminar
Friday, March 27, 2009 - 12:30pm for 2 hours
Skiles 255
Huy Huynh – School of Mathematics, Georgia Tech
Linwei Xin
This is due to the paper of Dr. Christian Houdre and Trevis Litherland. Let X_1, X_2,..., X_n be a sequence of iid random variables drawn uniformly from a finite ordered alphabets (a_1,...,a_m) where a_1 < a_2 < ...< a_m. Let LI_n be the length of the longest increasing subsequence of X_1,X_2,...,X_n. We'll express the limit distribution of LI_n as functionals of (m-1)-dimensional Brownian motion. This is an elementary case taken from this paper.