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

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.