More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run

DOI10.4153/CJM-1990-048-2zbMath0717.60015OpenAlexW2316640538MaRDI QIDQ5748648

Tamás F. Móri

Publication date: 1990

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1990-048-2

zbMATH Keywords

rate of convergencewaiting timecover timerunsequence patternsdouble exponential extreme value distributionlimit theorem for large deviations

Mathematics Subject Classification ID

Strong limit theorems (60F15) Combinatorial probability (60C05)

Related Items (8)

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? ⋮ Asymptotic independence of maximum waiting times for increasing alphabet ⋮ Deviation of discrete distributions -- positive and negative results ⋮ Limit theorem for the Robin Hood game ⋮ Poisson approximation

This page was built for publication: More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run