Skip to main content
SpringerLink
Log in

Exact distributions of constrained (k, ℓ) strings of failures between subsequent successes

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

Abstract

Consider a sequence of binary (success–failure) random variables (RVs) ordered on a line. The number of strings with a constrained number of consecutive failures between two subsequent successes is studied under an overlapping enumeration scheme. The respective waiting time is examined as well. The study is first developed on sequences of independent and identically distributed RVs. It is extended then on sequences of dependent, exchangeability and Markovian dependency is considered, and independent, not necessarily identically distributed, RVs. Exact probabilities and moments are obtained by means of combinatorial analysis and via recursive schemes. An explicit expression of the mean value of the number of strings for both independent and dependent sequences is derived. An application in system reliability is provided.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Antzoulakos DL (2001) On waiting time for patterns in a sequence of multistate trials. J Appl Probab 38: 508–518

    Article  MathSciNet  MATH  Google Scholar 

  • Antzoulakos DL (2003) Waiting times and number of appearances of runs: a unified approach. Commun Stat Theory Methods 32: 1289–1315

    Article  MathSciNet  MATH  Google Scholar 

  • Antzoulakos DL, Chadjiconstantinidis S (2001) Distributions of numbers of success runs of fixed length in Markov dependent trials. Ann Inst Stat Math 53: 599–619

    Article  MathSciNet  MATH  Google Scholar 

  • Balakrishnan N, Koutras MV (2002) Runs and scans with applications. Wiley, New York

    MATH  Google Scholar 

  • Billingsley P (1995) Probability and measure, 3rd edn. Wiley, New York

    MATH  Google Scholar 

  • Chern HH, Hwang HK, Yeh YN (2000) Distribution of the number of consecutive records. Random Struct Algorithms 17: 169–196

    Article  MathSciNet  MATH  Google Scholar 

  • Chern HH, Hwang HK (2005) Limit distribution of the number of consecutive records. Random Struct Algorithms 26: 404–417

    Article  MathSciNet  MATH  Google Scholar 

  • Dafnis SD, Antzoulakos DL, Philippou AN (2010) Distributions related to (k 1, k 2) events. J Stat Plan Inference 140: 1691–1700

    Article  MathSciNet  MATH  Google Scholar 

  • Dafnis SD, Philippou AN (2011) Distributions of patterns with applications in engineering. IAENG Int J Appl Math 41: 68–75

    MathSciNet  MATH  Google Scholar 

  • Dafnis SD, Philippou AN, Antzoulakos DL (2012) Distributions of patterns of two successes separated by a string of k−2 failures. Stat Pap 53: 323–344

    Article  MathSciNet  MATH  Google Scholar 

  • Demir S, Eryilmaz S (2010) Run statistics in a sequence of arbitrarily dependent binary trials. Stat Pap 51: 959–973

    Article  MathSciNet  MATH  Google Scholar 

  • Eryilmaz S (2008) Lifetime of combined k-out-of-n, and consecutive k c -out-of-n system. IEEE Trans Reliab 57: 331–335

    Article  Google Scholar 

  • Eryilmaz S (2010a) Discrete scan statistics generated by exchangeable binary trials. J Appl Probab 47: 1084–1092

    Article  MathSciNet  MATH  Google Scholar 

  • Eryilmaz S (2010b) On system reliability in stress-strength setup. Stat Probab Lett 80: 834–839

    Article  MathSciNet  MATH  Google Scholar 

  • Eryilmaz S. (2011) Joint distribution of run statistics in partially exchangeable processes. Stat Probab Lett 81: 163–168

    Article  MathSciNet  MATH  Google Scholar 

  • Eryilmaz S, Demir S (2007) Success runs in a sequence of exchangeable binary trials. J Stat Plan Inference 137: 2954–2963

    Article  MathSciNet  MATH  Google Scholar 

  • Eryilmaz S, Yalcin F (2011) On the mean and extreme distances between failures in Markovian binary sequences. J Comput Appl Math 236: 1502–1510

    Article  MathSciNet  MATH  Google Scholar 

  • Eryilmaz S, Zuo M (2010) Constrained (k, d)-out-of-n systems. Int J Syst Sci 41: 679–685

    Article  MathSciNet  MATH  Google Scholar 

  • Fu JC, Lou WYW (2003) Distribution theory of runs and patterns and its applications: a finite Markov chain approach. World Scientific, River Edge

    MATH  Google Scholar 

  • Fu JC, Lou WYW (2007) On the normal approximation for the distribution of the number of simple or compound patterns in a random sequence of multi-state trials. Methodol Comput Appl Probab 9: 195–205

    Article  MathSciNet  MATH  Google Scholar 

  • George EO, Bowman D (1995) A full likelihood procedure for analyzing exchangeable binary data. Biometrics 51: 512–523

    Article  MathSciNet  MATH  Google Scholar 

  • Glaz J, Balakrishnan N (1999) Scan statistics and applications. Birkhauser, Boston

    Book  MATH  Google Scholar 

  • Hahlin LO (1995) Double records. Research Report 1995:12. Department of Mathematics, Uppsala University, Uppsala

  • Hirano K, Aki S, Kashiwagi N, Kuboki H (1991) On Ling’s binomial and negative binomial distributions of order k. Stat Probab Lett 11: 503–509

    Article  MathSciNet  MATH  Google Scholar 

  • Holst L (2007) Counts of failure strings in certain Bernoulli sequences. J Appl Probab 44: 824–830

    Article  MathSciNet  MATH  Google Scholar 

  • Holst L (2008a) The number of two consecutive successes in a Hope–Polya urn. J Appl Probab 45: 901–906

    Article  MathSciNet  MATH  Google Scholar 

  • Holst L (2008b) A note on embedding certain Bernoulli sequences in marked Poisson proccesses. J Appl Probab 45: 1181–1185

    Article  MathSciNet  MATH  Google Scholar 

  • Holst L (2009) On consecutive records in certain Bernoulli sequences. J Appl Probab 46: 1201–1208

    Article  MathSciNet  MATH  Google Scholar 

  • Holst L (2011) A note on records in a random sequence. Arkiv Matematik 49: 351–356

    Article  MathSciNet  MATH  Google Scholar 

  • Huffer FW, Sethuraman J, Sethuraman S (2009) A study of counts of Bernoulli strings via conditional Poisson processes. Proc Am Math Soc 137: 2125–2134

    Article  MathSciNet  MATH  Google Scholar 

  • Inoue K, Aki S (2010) On the conditional and unconditional distributions of the number of success runs on a circle with applications. Stat Probab Lett 80: 874–885

    Article  MathSciNet  MATH  Google Scholar 

  • Jacquet P, Szpankowski W (2006) On (d, k) sequences not containing a given word. In: International symposium on information theory, pp 1486–1489

  • Joffe A, Marchand E, Perron F, Popadiuk P (2004) On sums of products of Bernoulli variables and random permutations. J Theor Probab 17: 285–292

    Article  MathSciNet  MATH  Google Scholar 

  • Kotz S, Lumelskii Y, Pensky M (2003) The stress-strength model and its generalizations. World Scientific, River Edge

    Book  MATH  Google Scholar 

  • Koutras MV (2003) Applications of Markov chains to the distribution theory of runs and patterns. In: Shanbhag DN, Rao CR (eds) Handbook of statistics, vol. 21. Elsevier, North Holland, pp 431–472

    Google Scholar 

  • Ling KD (1988) On binomial distributions of order k. Stat Probab Lett 6: 247–250

    Article  MATH  Google Scholar 

  • Mahmoud HM (2009) Polya urn models. CRC Press, Boca Raton

    MATH  Google Scholar 

  • Makri FS (2010) On occurrences of F–S strings in linearly and circularly ordered binary sequences. J Appl Probab 47: 157–178

    Article  MathSciNet  MATH  Google Scholar 

  • Makri FS (2011) Minimum and maximum distances between failures in binary sequences. Stat Probab Lett 81: 402–410

    Article  MathSciNet  MATH  Google Scholar 

  • Makri FS, Philippou AN, Psillakis ZM (2007a) Polya, inverse Polya, and circular Polya distributions of order k for ℓ-overlapping success runs. Commun Stat Theory Methods 36: 657–668

    Article  MathSciNet  MATH  Google Scholar 

  • Makri FS, Philippou AN, Psillakis ZM (2007b) Success run statistics defined on an urn model. Adv Appl Probab 39: 991–1019

    Article  MathSciNet  MATH  Google Scholar 

  • Makri FS, Psillakis ZM (2011a) On runs of length exceeding a threshold: normal approximation. Stat Pap 52: 531–551

    Article  MathSciNet  MATH  Google Scholar 

  • Makri FS, Psillakis ZM (2011b) On success runs of length exceeded a threshold. Methodol Comput Appl Probab 13: 269–305

    Article  MathSciNet  MATH  Google Scholar 

  • Makri FS, Psillakis ZM (2012) Counting certain binary strings. J Stat Plan Inference 142: 908–924

    Article  MathSciNet  MATH  Google Scholar 

  • Mori TF (2001) On the distribution of sums of overlapping products. Acta Sci Math (Szeged) 67: 833–841

    MathSciNet  MATH  Google Scholar 

  • Sarkar A, Sen K, Anuradha (2004) Waiting time distributions of runs in higher order Markov chains. Ann Inst Stat Math 56: 317–349

    Article  MathSciNet  MATH  Google Scholar 

  • Sen K, Goyal B (2004) Distributions of patterns of two failures separated by success runs of length k. J Korean Stat Soc 33: 35–58

    MathSciNet  Google Scholar 

  • Stefanov VT, Szpankowski W (2007) Waiting time distributions for pattern occurrence in a constrained sequence. Discret Math Theor Comput Sci 9: 305–320

    MathSciNet  MATH  Google Scholar 

  • Zehavi E, Wolf JC (1988) On runlength codes. IEEE Trans Inf Theory 34: 45–54

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Patras, 26500, Patras, Greece

    Frosso S. Makri

  2. Department of Physics, University of Patras, 26500, Patras, Greece

    Zaharias M. Psillakis

Authors
  1. Frosso S. Makri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zaharias M. Psillakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frosso S. Makri.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Makri, F.S., Psillakis, Z.M. Exact distributions of constrained (k, ℓ) strings of failures between subsequent successes. Stat Papers 54, 783–806 (2013). https://doi.org/10.1007/s00362-012-0462-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00362-012-0462-1

Keywords

Mathematics Subject Classification (2010)

Search

Navigation