On the waiting time till each of some given patterns occurs as a run (Q1263859)

From MaRDI portal
Revision as of 11:54, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the waiting time till each of some given patterns occurs as a run
scientific article

    Statements

    On the waiting time till each of some given patterns occurs as a run (English)
    0 references
    0 references
    0 references
    1991
    0 references
    A limit theorem is proved for the waiting time till each of a given set of length n patterns occurs as a run in a sequence of i.i.d. random variables distributed uniformly on \(\{\) 1,2,...,d\(\}\). A heuristic approach called the independence principle is introduced which can be applied to similar problems connected with waiting times.
    0 references
    0 references
    limit theorem
    0 references
    waiting time
    0 references
    run in a sequence
    0 references
    0 references