Abstract
Abstract The statistics of the number of success runs in a sequence of Bernoulli trials have been used in many statistical areas. For almost a century, even in the simplest case of independent and identically distributed Bernoulli trials, the exact distributions of many run statistics still remain unknown. Departing from the traditional combinatorial approach, in this article we present a simple unified approach for the distribution theory of runs based on a finite Markov chain imbedding technique. Our results cover not only the identical Bernoulli trials, but also the nonidentical Bernoulli trials. As a byproduct, our results also yield the exact distribution of the waiting time for the mth occurrence of a specific run.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
