Application of Smirnov words to waiting time distributions of runs
The electronic journal of combinatorics, Tome 24 (2017) no. 3
Consider infinite random words over a finite alphabet where the letters occur as an i.i.d. sequence according to some arbitrary distribution on the alphabet. The expectation and the variance of the waiting time for the first completed $h$-run of any letter (i.e., first occurrence of $h$ subsequential equal letters) is computed. The expected waiting time for the completion of $h$-runs of $j$ arbitrary distinct letters is also given.
DOI :
10.37236/5753
Classification :
05A05, 05A15, 60C05, 60G40, 68R10
Mots-clés : waiting time distribution, run, Smirnov word, generating function
Mots-clés : waiting time distribution, run, Smirnov word, generating function
@article{10_37236_5753,
author = {Uta Freiberg and Clemens Heuberger and Helmut Prodinger},
title = {Application of {Smirnov} words to waiting time distributions of runs},
journal = {The electronic journal of combinatorics},
year = {2017},
volume = {24},
number = {3},
doi = {10.37236/5753},
zbl = {1369.05006},
url = {http://geodesic.mathdoc.fr/articles/10.37236/5753/}
}
TY - JOUR AU - Uta Freiberg AU - Clemens Heuberger AU - Helmut Prodinger TI - Application of Smirnov words to waiting time distributions of runs JO - The electronic journal of combinatorics PY - 2017 VL - 24 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.37236/5753/ DO - 10.37236/5753 ID - 10_37236_5753 ER -
Uta Freiberg; Clemens Heuberger; Helmut Prodinger. Application of Smirnov words to waiting time distributions of runs. The electronic journal of combinatorics, Tome 24 (2017) no. 3. doi: 10.37236/5753
Cité par Sources :