Skip to main content
Log in

On binomial and circular binomial distributions of orderk forl-overlapping success runs of lengthk

  • Article
  • Published:
Statistical Papers Aims and scope Submit manuscript

Abstract

The number ofl-overlapping success runs of lengthk inn trials, which was introduced and studied recently, is presently reconsidered in the Bernoulli case and two exact formulas are derived for its probability distribution function in terms of multinomial and binomial coefficients respectively. A recurrence relation concerning this distribution, as well as its mean, is also obtained. Furthermore, the number ofl-overlapping success runs of lengthk inn Bernoulli trials arranged on a circle is presently considered for the first time and its probability distribution function and mean are derived. Finally, the latter distribution is related to the first, two open problems regarding limiting distributions are stated, and numerical illustrations are given in two tables. All results are new and they unify and extend several results of various authors on binomial and circular binomial distributions of orderk.

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. (1988). Some characteristics of the binomial distribution of orderk and related distributions,Statistical Theory and Data Analysis (ed. K. Matusita),2, 211–222, Elsevier, Amsterdam.

    Google Scholar 

  • Aki, S. and Hirano, K. (2000). Numbers of success runs of specified length until certain stopping time rules and generalized binomial distributions of orderk, Ann. Inst. Statist. Math.,52, 767–777.

    Article  MATH  MathSciNet  Google Scholar 

  • Antzoulakos, D.L. (2003). Waiting times and number of appearances of runs: a unified approach,Comm. Statist. Theory Meth.,32, 1289–1315.

    Article  MathSciNet  Google Scholar 

  • Antzoulakos, D.L. and Chadjiconstantinidis, S. (2001). Distributions of numbers of success runs of fixed length in Marcov dependent trials,Ann. Inst. Statist. Math.,53, 599–619.

    Article  MATH  MathSciNet  Google Scholar 

  • Balakrishnan, N. and Koutras, M.V. (2002).Runs and Scans with Applications, Wiley, New York.

    MATH  Google Scholar 

  • Barbour, A.D., Chryssaphinou, O. and Vaggelatou, E. (2001). Applications of compound Poisson approximation. InProbability and Statistical Models with Applications (Eds., Ch. A. Charalambides, M. V. Koutras and N. Balakrishnan), pp. 41–62, Chapman and Hall, Boca Raton, Frorida.

    Google Scholar 

  • Charalambides, Ch. A. (1994). Success runs in a circular sequence of independent Bernoulli trials,Runs and Patterns in Probability, Selected Papers (eds, A.P. Godbole and S.G. Papastavridis), 15–30, Kluwer, Dordrecht.

    Google Scholar 

  • Eryilmaz, S. (2003). On the distribution and expectation of success runs in nonhomogeneous markov dependent trials,Statistical Papers (to appear).

  • Ling, K.D. (1988). On binomial distributions of orderk, Statist. Probab. Lett.,6, 247–250.

    Article  MATH  MathSciNet  Google Scholar 

  • Makri, F.S. and Philippou, A.N. (1994). Binomial distributions of orderk on the circle.Runs and Patterns in Probability (eds A.P. Godbole and S.G. Papastavridis), 65–81, Kluwer, Dordrecht.

    Google Scholar 

  • Makri, F.S. and Philippou, A.N. (1996). Exact reliability formulas for linear and circularm-consecutive-k-out-of-n:F systems,Microelectron. Reliab.,36, 657–660.

    Article  Google Scholar 

  • Mises, R. von (1921). Das problem der iterationen.Z. Angew. Math. Mech.,1, 298–307.

    Google Scholar 

  • Papastavridis, S.G. (1990).m-consecutive-k-out-of-n:F system,IEEE Trans. Reliab.,39, 386–388.

    Article  MATH  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 et al.), 203–227, D. Reidel, Dordrecht.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  • riordan, J. (1964).An Introduction to Combinatorial Analysis. 2nd ed., Wiley, New York.

    Google Scholar 

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

    MATH  Google Scholar 

  • Geske, M.X., Godbole, A.P., Schaffner, A.A., Skolnick, A.M. and Wallstrom, G.L. (1995) Compound Poisson approximations for word patterns under Markovian hypotheses,J. Appl. Probab.,32, 877–892.

    Article  MATH  MathSciNet  Google Scholar 

  • Godbole, A.P. (1990). Specific formulae for some success run distributions.Statist. Probab. Lett.,10, 119–124.

    Article  MATH  MathSciNet  Google Scholar 

  • Han, S. and Aki, S. (2000). A unified approach to binomial-type distributions of orderk, Comm. Statist. Theory Methods,29, 1929–1943.

    Article  MATH  MathSciNet  Google Scholar 

  • Hirano, K. (1986). Some properties of the distributions of orderk, Fibonacci Numbers and Their Applications (eds A.N. Philippou, G.E. Bergum, A.F. Horadam), 43–53, Reidel, Dordrecht.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  • Hirano, K., Aki, S., Kashiwagi, N. and Kuboki, H. (1991). On Ling's binomial and negative binomial distributions of orderk, Statist. Probab. Lett.,11, 503–509.

    Article  MATH  MathSciNet  Google Scholar 

  • Inoue, K. and Aki, S. (2003). Generalized binomial and negative binomial distributions of orderk by thel-overlapping enumeration scheme.Ann. Inst. Statist. Math.,55, 153–167.

    MATH  MathSciNet  Google Scholar 

  • Koutras, M.V., Papadopoulos, G.K. and Papastavridis, S.G. (1994). Circular overlapping success runs,Runs and Patterns in Probability (eds A.P. Godbole and S.G. Papastavridis), 287–305, Kluwer, Dordrecht.

    Google Scholar 

  • Koutras, M.V., Papadopoulos, G.K. and Papastavridis, S.G. (1995). Runs on a circle.J. Appl. Probab. 32, 396–404.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Makri, F.S., Philippou, A.N. On binomial and circular binomial distributions of orderk forl-overlapping success runs of lengthk . Statistical Papers 46, 411–432 (2005). https://doi.org/10.1007/BF02762842

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords and phrases

Navigation