Asymptotic behavior of some factorizations of random words - Archive ouverte HAL
Article Dans Une Revue Random Structures and Algorithms Année : 2021

Asymptotic behavior of some factorizations of random words

Philippe Chassaing
Elahe Zohoorian Azad
  • Fonction : Auteur
  • PersonId : 868957

Résumé

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.
Fichier principal
Vignette du fichier
version12.pdf (327.17 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00475379 , version 1 (22-04-2010)
hal-00475379 , version 2 (04-11-2021)

Identifiants

Citer

Philippe Chassaing, Elahe Zohoorian Azad. Asymptotic behavior of some factorizations of random words. Random Structures and Algorithms, In press. ⟨hal-00475379v1⟩
169 Consultations
104 Téléchargements

Altmetric

Partager

More