On the Limiting Shape of Markovian Random Young Tableaux

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Let $(X_n)_{n \ge 0}$ be an irreducible, aperiodic, homogeneous Markov chain, with state space an ordered finite alphabet of size $m$. Using combinatorial constructions and weak invariance principles, we obtain the limiting shape of the associated Young tableau as a multidimensional Brownian functional. Since the length of the top row of the Young tableau is also the length of the longest (weakly) increasing subsequence of $(X_k)_{1\le k \le n}$, the corresponding limiting law follows. We relate our results to a conjecture of Kuperberg by showing that, under a cyclic condition, a spectral characterization of the Markov transition matrix delineates precisely when the limiting shape is the spectrum of the traceless GUE. For $m=3$, all cyclic Markov chains have such a limiting shape, a fact previously known for $m=2$. However, this is no longer true for $m \ge 4$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the Limiting Shape of Markovian Random Young Tableaux does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Limiting Shape of Markovian Random Young Tableaux, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Limiting Shape of Markovian Random Young Tableaux will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-368463

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.