Stochastic Ordering Among Success Runs Statistics in a Sequence of Exchangeable Binary Trials

  • Serkan Eryilmaz


A new scheme-distribution-based representation is presented for the cumulative distribution function of the number of success runs of length k in a sequence of exchangeable binary trials. By utilizing this new representation, some stochastic ordering results are obtained to compare success runs. The results are illustrated for beta-binomial distributions of order k.


Binomial distribution of order k Exchangeable binary random variables Stochastic ordering Success runs 

Mathematics Subject Classification (2010)

60E05 62E15 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



The author thanks the referees for their helpful comments and suggestions, which were very useful in improving this article.


  1. Antzoulakos DL, Chadjiconstantinidis S (2001) Distributions of numbers of success runs of fixed length in Markov dependent trials. Ann Inst Stat Math 53:599–619MathSciNetCrossRefzbMATHGoogle Scholar
  2. Atalay DS, Zeybek M (2013) Circular success and failure runs in a sequence of exchangeable binary trials. J Stat Plann Inference 143:621–629MathSciNetCrossRefzbMATHGoogle Scholar
  3. Balakrishan N, Koutras MV (2002) Runs and scans with applications. Wiley, New YorkzbMATHGoogle Scholar
  4. Balakrishnan N, Triantafyllou IS, Koutras MV (2009) Nonparametric control charts based on runs and Wilcoxon-type rank-sum statistics. J Stat Plann Inference 139:3177–3192MathSciNetCrossRefzbMATHGoogle Scholar
  5. Balakrishnan N, Koutras MV, Milienos FS (2014a) Some binary start-up demonstration tests and associated inferential methods. Ann Inst Stat Math 66:759–787MathSciNetCrossRefzbMATHGoogle Scholar
  6. Balakrishnan N, Koutras MV, Milienos FS (2014b) Start-up demonstration tests: models, methods and applications, with some unications. Appl Stoch Model Bus Ind 30:373–413CrossRefzbMATHGoogle Scholar
  7. Chang W-Y, Gupta R-D, Richards DStP (2010) Structural properties of the generalized Dirichlet distributions. Contemp Math 5–16Google Scholar
  8. Charalambides CA (2002) Enumerative combinatorics. Chapman and Hall/CRC, LondonzbMATHGoogle Scholar
  9. Cheung LW (2004) Use of runs statistics for pattern recognition in genomic DNA sequences. J Comput Biol 11:107–124CrossRefGoogle Scholar
  10. Eryilmaz S, Demir S (2007) Success runs in a sequence of exchangeable binary trials. J Stat Plann Inference 137:2954–2963MathSciNetCrossRefzbMATHGoogle Scholar
  11. Eryilmaz S, Zuo MJ (2010) Constrained (k, d)-out-of-n systems. Int J Syst Sci 41(6):679–685MathSciNetCrossRefzbMATHGoogle Scholar
  12. Fu JC, Koutras MV (1994) Distribution theory of runs: a Markov chain approach. J Amer Statist Assoc 89:1050–1058MathSciNetCrossRefzbMATHGoogle Scholar
  13. Goldstein L (1990) Poisson approximations and DNA sequence matching. Commun Stat- Theory Methods 19:4167–4179MathSciNetCrossRefzbMATHGoogle Scholar
  14. Koutras MV, Alexandrou VA (1997) Non-parametric randomness tests based on success runs of fixed length. Stat Probab Lett 32:393–404MathSciNetCrossRefzbMATHGoogle Scholar
  15. Koutras MV, Bersimis S, Maravelakis PE (2007) Statistical process control using Shewart control charts with supplementary runs rules. Methodol Comput Appl Probab 9:207–224MathSciNetCrossRefzbMATHGoogle Scholar
  16. Ling KD (1988) On binomial distribution of order k. Stat Probab Lett 6:247–250MathSciNetCrossRefzbMATHGoogle Scholar
  17. Lou WYW (2003) The exact distribution of the k-tuple statistic for sequence homology. Stat Probab Lett 61:51–59MathSciNetCrossRefzbMATHGoogle Scholar
  18. Makri FS, Philippou AN (2005) On binomial and circular binomial distributions of order k for l-overlapping success runs of length k. Stat Pap 46:411–432MathSciNetCrossRefzbMATHGoogle Scholar
  19. Makri FS, Philippou AN, Psillakis ZM (2007a) Success run statistics defined on an urn model. Adv Appl Probab 39:991–1019MathSciNetCrossRefzbMATHGoogle Scholar
  20. Makri FS, Philippou AN, Psillakis ZM (2007b) Polya, inverse Polya, and circular Polya distributions of order k for l-overlapping success runs. Commun Stat-Theory Methods 36:657–668MathSciNetCrossRefzbMATHGoogle Scholar
  21. Makri FS, Psillakis ZM (2011) On success runs of length exceeded a threshold. Methodol Comput Appl Probab 13:269–305MathSciNetCrossRefzbMATHGoogle Scholar
  22. Philippou A (1988) Recursive theorems for success runs and reliability of consecutive-k-out-of-n:F systems. In: Philippou AN, Horadam AF, Bergum GE (eds) Applications of Fibonacci numbers. Springer, Berlin, pp 149–160CrossRefGoogle Scholar
  23. Sen K, Agarwal ML, Chakraborty S (2002) Lengths of runs and waiting time distributions by using Polya-Eggenberger sampling scheme. Stud Sci Math Hung 39:309–332zbMATHGoogle Scholar
  24. Shaked M, Shanthikumar JG (2007) Stochastic orders. Springer-Verlag, New YorkCrossRefzbMATHGoogle Scholar
  25. Wolfowitz J (1943) On the theory of runs with some applications to quality control. Ann Math Statist 14:280–288MathSciNetCrossRefzbMATHGoogle Scholar
  26. Yalcin F (2013) On a generalization of Ling’s binomial distribution. ISTATISTIK: J Turk Stat Assoc 6:110–115MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Department of Industrial EngineeringAtilim UniversityAnkaraTurkey

Personalised recommendations