Random Walks on Strict Partitions

Details Random Walks on Strict Partitions Random Walks on Strict Partitions

2009-04-11

arxiv.org/abs/0904.1823v1

Journal of Mathematical Sciences, vol. 168, no. 3, pp. 437-463, 2010

Mathematics

Probability

LaTeX, 54 pages, 3 figures

Scientific paper

We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to a continuous-time Markov process. The state space of this process is the infinite-dimensional simplex consisting of all nonincreasing infinite sequences of nonnegative numbers with sum less than or equal to one. The main result about the limit process is the expression of its the pre-generator as a formal second order differential operator in a polynomial algebra. Of separate interest is the generalization of Kerov interlacing coordinates to the case of shifted Young diagrams.

Affiliated with

Also associated with

No associations

Rating

Random Walks on Strict Partitions 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 Random Walks on Strict Partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Walks on Strict Partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239862