Trevis J. Litherland

activity

20062017

most citedOn the Limiting Shape of Young Diagrams Associated With Markov Random Words

9 citations · 15 across the 5 of their papers we have counts for

collaborators

Showing 2011 · math.PRShow all

2 papers · 2 filters

math.PR2011★ 9 cited

On the Limiting Shape of Young Diagrams Associated With Markov Random Words

Christian Houdré, Trevis J. Litherland

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

math.PR2011

Asymptotics for the Length of the Longest Increasing Subsequence of Binary Markov Random Word

Christian Houdré, Trevis J. Litherland

Let $(X_{n})_{n \geq 0}$ be an irreducible, aperiodic, and homogeneous binary Markov chain and let $L I_{n}$ be the length of the longest (weakly) increasing subsequence of $(X_k)_{1\le k…