Trevis J. Litherland

most citedOn the Limiting Shape of Markovian Random Young Tableaux

6 citations · 6 across the 2 of their papers we have counts for

collaborators

Showing math.PRShow all

2 papers · 1 filter

math.PR2008★ 6 cited

On the Limiting Shape of Markovian Random Young Tableaux

Christian Houdré, Trevis J. Litherland

Let $(X_{n})_{n \geq 0}$ be an irreducible, aperiodic, homogeneous Markov chain, with state space an ordered finite alphabet of size $m$ . Using combinatorial constructions and weak in…

math.PR2006

On the Longest Increasing Subsequence for Finite and Countable Alphabets

Christian houdré, Trevis J. Litherland

Let $X_{1}, X_{2}, ..., X_{n}, ...$ be a sequence of iid random variables with values in a finite alphabet ${1, ..., m}$ . Let $L I_{n}$ be the length of the longest increasing subsequence…