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

DOI10.1007/BF01312212zbMath0688.60006OpenAlexW2042698037MaRDI QIDQ1263859

Tamás F. Móri

Publication date: 1991

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01312212

zbMATH Keywords

waiting timelimit theoremrun in a sequence

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Related Items (7)

Asymptotic expansions for the maximum of random number of random variables ⋮ Covering with blocks in the non-symmetric case ⋮ Maximum Waiting Times are Asymptotically Independent ⋮ Cover times for words in symmetric and nonsymmetric cases: A comparison ⋮ How homogeneous can the last appearing pattern be? ⋮ How long does it take to see a flat Brownian path on the average? ⋮ Success run statistics defined on an urn model

Cites Work

• Asymptotic independence of 'pure head' stopping times
• Large deviation results for waiting times in repeated experiments
• A martingale approach to the study of occurrence of sequence patterns in repeated experiments
• String overlaps, pattern matching, and nontransitive games
• On a new law of large numbers
• The statistical analysis of direct repeats in nucleic acid sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the waiting time till each of some given patterns occurs as a run