Article contents
Maximum Waiting Times are Asymptotically Independent
Published online by Cambridge University Press: 12 September 2008
Abstract
For every n consider a subset Hn of the patterns of length n over a fixed finite alphabet. The limit distribution of the waiting time until each element of Hn appears in an infinite sequence of independent, uniformly distributed random letters was determined in an earlier paper. This time we prove that these waiting times are getting independent as n → ∞. Our result is used for applying the converse part of the Borel–Cantelli lemma to problems connected with such waiting times, yielding thus improvements on some known theorems.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1992
References
- 4
- Cited by