Success runs in a two-state Markov chain

Publisher Website
Google Scholar
Abstract
Success runs of a fixed length in a two-state Markov chain are discussed. The results are analogous to those in the case of independent Bernoulli trials. The generating function of the waiting time for the first occurrence of a success run is obtained from the theory of recurrent events. Under certain conditions, the distribution of the number of long runs in a large number of trials is shown to be Poisson.

This publication has 0 references indexed in Scilit: