Skip to main content
Log in

On Waiting Time Problems Associated with Runs in Markov Dependent Trials

  • Published:
Annals of the Institute of Statistical Mathematics Aims and scope Submit manuscript

Abstract

A general technique is developed to study the waiting time distribution for the r-th occurrence of a success run of length k in a sequence of Markov dependent trials. Sooner and later waiting time problems are also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  • Aki, S. (1992). Waiting time problems for a sequence of discrete random variables, Ann. Inst. Statist. Math., 44, 363–378.

    Google Scholar 

  • Aki, S. and Hirano, K. (1993). Discrete distributions related to succession events in a two-state Markov chain, Statistical Science and Data Analysis (eds. K. Matusita, M. I. Puri and T. Hayakawa), 467–474, VSP International Science Publishers, Zeist.

    Google Scholar 

  • Aki, S., Balakrishnan, N. and Mohanty, S. G. (1996). Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials, Ann. Inst. Statist. Math., 48, 773–787.

    Google Scholar 

  • Balasubramanian, K., Viveros, R. and Balakrishnan, K. (1993). Sooner and later waiting time problems for Markovian Bernoulli trials, Statist. Probab. Lett., 18, 153–161.

    Google Scholar 

  • Ebneshahrashooh, M. and Sobel, M. (1990). Sooner and later waiting time problems for Bernoulli trials: frequency and run quotas, Statist. Probab. Lett., 9, 5–11.

    Google Scholar 

  • Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. I, 3rd ed., Wiley, New York.

    Google Scholar 

  • Fu, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multi-state trials, Statist. Sinica, 6, 957–974.

    Google Scholar 

  • Fu, J. C. and Kontras, M. V. (1994). Distribution theory of runs: A Markov chain approach, J. Amer. Statist. Assoc., 89, 1050–1058.

    Google Scholar 

  • Goldstein, L. (1990). Poisson approximation in DNA sequence matching, Comm. Statist. Theory Methods, 19, 4167–4179.

    Google Scholar 

  • Koutras, M. V. (1997). Waiting time distributions associated with runs of fixed length in two-state Markov chains, Ann. Inst. Statist. Math., 49, 123–139.

    Google Scholar 

  • Koutras, M. V. and Alexandrou, V. A. (1995). Runs, scans and urn model distributions: A unified Markov chain approach, Ann. Inst. Statist. Math., 47, 743–766.

    Google Scholar 

  • Ling, K. D. (1989). A new class of negative binomial distributions of order k, Statist. Probab. Lett., 7, 371–376.

    Google Scholar 

  • Mohanty, S. G. (1994). Success runs of length k in Markov dependent trials, Ann. Inst. Statist. Math., 46, 777–796.

    Google Scholar 

  • Mood, A. M. (1940). The distribution theory of runs, Ann. Math. Statist., 11, 367–392.

    Google Scholar 

  • Philippou, A. N. (1984). The negative binomial distribution of order k and some of its properties, Biometrical J., 26, 789–794.

    Google Scholar 

  • Philippou, A. N., Georghiou, C. and Philippou, G. N. (1983). A generalized geometric distribution and some of its properties, Statist. Probab. Lett., 1, 171–175.

    Google Scholar 

  • Uchida, M. and Aki, S. (1995). Sooner and later waiting time problems in a two-state Markov chain, Ann. Inst. Statist. Math., 47, 415–433.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

About this article

Cite this article

Antzoulakos, D.L. On Waiting Time Problems Associated with Runs in Markov Dependent Trials. Annals of the Institute of Statistical Mathematics 51, 323–330 (1999). https://doi.org/10.1023/A:1003862225719

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1003862225719

Navigation