Application of Smirnov words to waiting time distributions of runs

Date
2017
Journal Title
Journal ISSN
Volume Title
Publisher
Electronic Journal of Combinatorics
Abstract
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.
Description
CITATION: Freiberg, U., Heuberger, C. & Prodinger, H. 2017. Application of Smirnov words to waiting time distributions of runs. Electronic Journal of Combinatorics, 24(3):#P3.55.
The original publication is available at http://www.combinatorics.org/ojs/index.php/eljc/index
Keywords
Smirnov words, Waiting time distribution (Mathematics), Generating function (Mathematics)
Citation
Freiberg, U., Heuberger, C. & Prodinger, H. 2017. Application of Smirnov words to waiting time distributions of runs. Electronic Journal of Combinatorics, 24(3):#P3.55.