Limit law of the standard right factor of a random Lyndon word
Regine Marchand, Elahe Zohoorian Azad
Abstract
Consider the set of finite words on a totally ordered alphabet with q letters. We prove that the distribution of the length of the standard right factor of a random Lyndon word with length n, divided by n, converges to: μ(dx)=1q δ1(dx) + q-1q 1[0,1)(x)dx, when n goes to infinity. The convergence of all moments follows. This paper completes thus the results of Bassino, giving the asymptotics of the mean length of the standard right factor of a random Lyndon word with length n in the case of a two letters alphabet.
Create a lesson
Related papers
Sublinear multi-type preferential attachment
Anna Ben-Hamou, Nicolas Broutin, Camille Cazaux
Uniform Central Limit Theorems for Degree Distributions of Sparse Graphon Models
Robert Lunde, Soumendra Lahiri
Matching Random Point Sets with Minimum Distortion
Itai Benjamini, Mark Braverman, Elad Tzalik et al.
Uniqueness and full coverage in k-neighbor graphs
David Coupier, Benoît Henry, Benedikt Jahnel et al.
Bass martingales need not stretch
Mathias Beiglböck, Manuel Hasenbichler, Gudmund Pammer
Universality of smallest singular values of random row submatrices and phase retrieval problems
Shu Wen, Christian E. Häggblom, Xiufan Yang