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

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

Résumé

In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} 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 that the limit law of the normalized 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 consider the \emph{standard factorization} of random \emph{Lyndon word} : 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
LyndonEZPCv2.pdf (474.42 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

Citer

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

Altmetric

Partager

More