Asymptotic behavior of some factorizations of random words

Details Asymptotic behavior of some factorizations of random words Asymptotic behavior of some factorizations of random words

2010-04-23

arxiv.org/abs/1004.4062v1

Mathematics

Probability

Scientific paper

This paper considers the normalized lengths of the factors of the Lyndon decomposition of finite random words with $n$ independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. We prove, firstly, that the limit law of the lengths of the smallest Lyndon factors is a variant of the stickbreaking process. Convergence of the distribution of the lengths of the longest factors to a Poisson-Dirichlet distribution follows. Secondly, we prove that the distribution of the normalized length of the standard right factor of a random $n$-letters long Lyndon word, derived from such an alphabet, converges, when $n$ is large, to: $$ \mu(dx)=p_1 \delta_{1}(dx) + (1-p_1) \mathbf{1}_{[0,1)}(x)dx, $$ in which $p_1$ denotes the probability of the smallest letter of the alphabet.

Affiliated with

Also associated with

No associations

Rating

Asymptotic behavior of some factorizations of random words 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 Asymptotic behavior of some factorizations of random words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic behavior of some factorizations of random words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-694159