Application of Smirnov words to waiting time distributions of runs (Q2401440)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6772927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Application of Smirnov words to waiting time distributions of runs |
scientific article; zbMATH DE number 6772927 |
Statements
Application of Smirnov words to waiting time distributions of runs (English)
0 references
8 September 2017
0 references
Summary: 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.
0 references
waiting time distribution
0 references
run
0 references
Smirnov word
0 references
generating function
0 references
0.8217996954917908
0 references
0.8012176752090454
0 references
0.7836027145385742
0 references
