Maximum Waiting Times are Asymptotically Independent

DOI10.1017/S0963548300000286zbMath0798.60013OpenAlexW2081322508MaRDI QIDQ4291202

Tamás F. Móri

Publication date: 5 May 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000286

zbMATH Keywords

asymptotically independentrandom letters

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Limit theorems in probability theory (60F99)

Related Items (3)

Covering with blocks in the non-symmetric case ⋮ Cover times for words in symmetric and nonsymmetric cases: A comparison ⋮ Asymptotic independence of maximum waiting times for increasing alphabet

Cites Work

• Large deviation results for waiting times in repeated experiments
• On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process
• Random walks on \(Z^n_2\)
• A martingale approach to the study of occurrence of sequence patterns in repeated experiments
• On the waiting time till each of some given patterns occurs as a run
• More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run

This page was built for publication: Maximum Waiting Times are Asymptotically Independent