Skip to main content
Log in

Success runs of lengthk in Markov dependent trials

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

Abstract

The geometric type and inverse Polýa-Eggenberger type distributions of waiting time for success runs of lengthk in two-state Markov dependent trials are derived by using the probability generating function method and the combinatorial method. The second is related to the minimal sufficient partition of the sample space. The first two moments of the geometric type distribution are obtained. Generalizations to ballot type probabilities of which negative binomial probabilities are special cases are considered. Since the probabilities do not form a proper distribution, a modification is introduced and new distributions of orderk for Markov dependent trials are developed.

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. and Hirano, K. (1987). Some characteristics of the binomial distribution of orderk and related distributions,Statistical Theory and Data Analysis II (ed. K. Matusita), North-Holland, Amsterdam.

    Google Scholar 

  • Aki, S. and Hirano, K. (1993). Discrete distributions related to succession events in a two-state Markov chain,Statistical Sciences and Data Analysis; Proceedings of the Third Pacific Area Statistical Conference (eds. K. Matusita, M. L. Puri and T. Hayakawa), 467–474, VSP International Science Publishers, Zeist.

    Google Scholar 

  • Aki, S., Kuboki, H. and Hirano, K. (1984). On discrete distributions of orderk, Ann. Inst. Statist. Math.,36, 431–440.

    Google Scholar 

  • Balakrishnan, N., Balasubramanian, K. and Viveros, R. (1992). Probability models and inference for start-up demonstration tests under correlation and corrective action,Naval Research Logistics (to appear).

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

    Google Scholar 

  • Bhat, U. N. and Lal, L. (1988). Number of successes in Markov trials,Adv. in Appl. Probab.,20, 677–680.

    Google Scholar 

  • Blackwell, D. and Girshick, M. A. (1954).Theory of Games and Statistical Decisions, Wiley, New York.

    Google Scholar 

  • Böhm, W. and Mohanty, S. G. (1994). On discrete time Markovian N-policy queues involving batches,Sankhyā Ser. A.,11, 1–20.

    Google Scholar 

  • Charalambides, Ch. A. (1986). On discrete distributions of orderk, Ann. Inst. Statist. Math.,38, 557–568.

    Google Scholar 

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

    Google Scholar 

  • Gabriel, K. R. (1959). The distribution of the number of successes in a sequence of dependent trials,Biometrika,46, 454–460.

    Google Scholar 

  • Hahn, G. J. and Gage, J. B. (1983). Evaluation of a start-up demonstration test,Journal of Quality Technology,15, 103–106.

    Google Scholar 

  • Hirano, K. (1986). On discrete distributions of orderk, Fibonacci Numbers and Their Applications (eds. A. N. Philippou, G. E. Bergam and A. F. Horadam), 45–53, Reidel, Dordrecht.

    Google Scholar 

  • Hirano, K. and Aki, S. (1993). On the number of occurrences of success runs of specified length in a two-state Markov chain,Statist. Sinica,3, 313–320.

    Google Scholar 

  • Jain, G. C. (1971). Some results in a correlated random walk,Canad. Math. Bull.,14, 341–347.

    Google Scholar 

  • Jain, G. C. (1973). On the expected number of visits of a particle before absorption in a correlated random walk,Canad. Math. Bull.,16, 389–395.

    Google Scholar 

  • Johnson, N. L. and Kotz, S. (1977).Urn Models and Their Application, Wiley, New York.

    Google Scholar 

  • Klotz, J. (1972). Markov chain clustering of births by sex,Proc. Sixth Berkeley Symp. Math. Statist. Prob., Vol. 4, 173–185, Univ. of California Press, Berkeley.

    Google Scholar 

  • Kotz, J. (1973). Statistical inference in Bernoulli trials with dependence,Ann. Statist.,1, 373–379.

    Google Scholar 

  • Lal, R. and Bhat, U. N. (1989). Some explicit results for correlated random walks,J. Appl. Probab.,27, 757–766.

    Google Scholar 

  • Mohanty, S. G. (1966a). On a generalized two-coin tossing problems,Biometrishe Z.,8, 266–272.

    Google Scholar 

  • Mohanty, S. G. (1966b). Some convolutions with multinomial coefficients and related probability distributions,SIAM Rev.,8, 501–509.

    Google Scholar 

  • Mohanty, S. G. (1979).Lattice Path Counting and Applications, Academic Press, New York.

    Google Scholar 

  • Nain, R. B. and Sen, K. (1979). Correlated random walk with absorbing barriers,Metron,37, 149–163.

    Google Scholar 

  • Narayana, T. V. (1959). A partial order and its applications to probability theory,Sankhyā,21, 91–98.

    Google Scholar 

  • Narayana, T. V. and Sathe, Y. S. (1961). Minimum variance unbiased estimation in coin tossing problems,Sankhyā Ser. A,23, 183–186.

    Google Scholar 

  • Narayana, T. V., Chorneyko, I. Z. and Sathe, Y. S. (1960). Sufficient partitions for a class of coin tossing problems,Biometrishe,2, 269–275.

    Google Scholar 

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

    Google Scholar 

  • Philippou, A. N. (1986). Distributions and Fibonacci polynomials of orderk, longest runs, and reliability of consecutive-k-out-of-n:F systems,Fibonacci Numbers and Their Applications (eds. A. N. Philippou, G. E. Bergam and A. F. Horadam), 203–227, Reidel, Dordrecht.

    Google Scholar 

  • Philippou, A. N. (1988). On multiparameter distributions of orderk, Ann. Inst. Statist. Math.,40, 467–475.

    Google Scholar 

  • Philippou, A. N. and Makri, F. S. (1985). Longest success runs and Fibonacci-type polynomials,Fibonacci Quart.,23, 338–345.

    Google Scholar 

  • Philippou, A. N. and Makri, F. S. (1986). Successes, runs and longest runs,Statist. Probab. Lett.,4, 211–215.

    Google Scholar 

  • Philippou, A. N. and Muwafi, A. A. (1982). Waiting for thek-th consecutive success and Fibonacci sequence of orderk, Fibonacci Quart.,20, 28–32.

    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 

  • Philippou, A. N., Tripsiannis, G. A. and Antzoulakos, D. L. (1989). New Polya and inverse Polya distributions of orderk, Commun. Statist. Theory Methods,18, 2125–2137.

    Google Scholar 

  • Rajarshi, M. B. (1974). Success runs in a 2-state Markov chain,J. Appl. Probab.,11, 190–192.

    Google Scholar 

  • Seth, A. (1963). The correlated unrestricted random walk,J. Roy. Statist. Soc. Ser. B,25, 394–400.

    Google Scholar 

  • Turner, S. J. (1979). Probability via theN-th order Fibonacci-T sequence,Fibonacci Quart.,17, 23–28.

    Google Scholar 

  • Viveros, R. and Balakrishnan, N. (1993). Statistical inference from start-up demonstration test data,Journal of Quality Control,25, 119–130.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

About this article

Cite this article

Mohanty, S.G. Success runs of lengthk in Markov dependent trials. Ann Inst Stat Math 46, 777–796 (1994). https://doi.org/10.1007/BF00773482

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00773482

Key words and phrases

Navigation