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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Antzoulakos DL (2001) On waiting time for patterns in a sequence of multistate trials. J Appl Probab 38: 508–518
Antzoulakos DL (2003) Waiting times and number of appearances of runs: a unified approach. Commun Stat Theory Methods 32: 1289–1315
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
Balakrishnan N, Koutras MV (2002) Runs and scans with applications. Wiley, New York
Billingsley P (1995) Probability and measure, 3rd edn. Wiley, New York
Chern HH, Hwang HK, Yeh YN (2000) Distribution of the number of consecutive records. Random Struct Algorithms 17: 169–196
Chern HH, Hwang HK (2005) Limit distribution of the number of consecutive records. Random Struct Algorithms 26: 404–417
Dafnis SD, Antzoulakos DL, Philippou AN (2010) Distributions related to (k 1, k 2) events. J Stat Plan Inference 140: 1691–1700
Dafnis SD, Philippou AN (2011) Distributions of patterns with applications in engineering. IAENG Int J Appl Math 41: 68–75
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
Demir S, Eryilmaz S (2010) Run statistics in a sequence of arbitrarily dependent binary trials. Stat Pap 51: 959–973
Eryilmaz S (2008) Lifetime of combined k-out-of-n, and consecutive k c -out-of-n system. IEEE Trans Reliab 57: 331–335
Eryilmaz S (2010a) Discrete scan statistics generated by exchangeable binary trials. J Appl Probab 47: 1084–1092
Eryilmaz S (2010b) On system reliability in stress-strength setup. Stat Probab Lett 80: 834–839
Eryilmaz S. (2011) Joint distribution of run statistics in partially exchangeable processes. Stat Probab Lett 81: 163–168
Eryilmaz S, Demir S (2007) Success runs in a sequence of exchangeable binary trials. J Stat Plan Inference 137: 2954–2963
Eryilmaz S, Yalcin F (2011) On the mean and extreme distances between failures in Markovian binary sequences. J Comput Appl Math 236: 1502–1510
Eryilmaz S, Zuo M (2010) Constrained (k, d)-out-of-n systems. Int J Syst Sci 41: 679–685
Fu JC, Lou WYW (2003) Distribution theory of runs and patterns and its applications: a finite Markov chain approach. World Scientific, River Edge
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
George EO, Bowman D (1995) A full likelihood procedure for analyzing exchangeable binary data. Biometrics 51: 512–523
Glaz J, Balakrishnan N (1999) Scan statistics and applications. Birkhauser, Boston
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
Holst L (2007) Counts of failure strings in certain Bernoulli sequences. J Appl Probab 44: 824–830
Holst L (2008a) The number of two consecutive successes in a Hope–Polya urn. J Appl Probab 45: 901–906
Holst L (2008b) A note on embedding certain Bernoulli sequences in marked Poisson proccesses. J Appl Probab 45: 1181–1185
Holst L (2009) On consecutive records in certain Bernoulli sequences. J Appl Probab 46: 1201–1208
Holst L (2011) A note on records in a random sequence. Arkiv Matematik 49: 351–356
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
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
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
Kotz S, Lumelskii Y, Pensky M (2003) The stress-strength model and its generalizations. World Scientific, River Edge
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
Ling KD (1988) On binomial distributions of order k. Stat Probab Lett 6: 247–250
Mahmoud HM (2009) Polya urn models. CRC Press, Boca Raton
Makri FS (2010) On occurrences of F–S strings in linearly and circularly ordered binary sequences. J Appl Probab 47: 157–178
Makri FS (2011) Minimum and maximum distances between failures in binary sequences. Stat Probab Lett 81: 402–410
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
Makri FS, Philippou AN, Psillakis ZM (2007b) Success run statistics defined on an urn model. Adv Appl Probab 39: 991–1019
Makri FS, Psillakis ZM (2011a) On runs of length exceeding a threshold: normal approximation. Stat Pap 52: 531–551
Makri FS, Psillakis ZM (2011b) On success runs of length exceeded a threshold. Methodol Comput Appl Probab 13: 269–305
Makri FS, Psillakis ZM (2012) Counting certain binary strings. J Stat Plan Inference 142: 908–924
Mori TF (2001) On the distribution of sums of overlapping products. Acta Sci Math (Szeged) 67: 833–841
Sarkar A, Sen K, Anuradha (2004) Waiting time distributions of runs in higher order Markov chains. Ann Inst Stat Math 56: 317–349
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
Stefanov VT, Szpankowski W (2007) Waiting time distributions for pattern occurrence in a constrained sequence. Discret Math Theor Comput Sci 9: 305–320
Zehavi E, Wolf JC (1988) On runlength codes. IEEE Trans Inf Theory 34: 45–54
Author information
Authors and Affiliations
Corresponding author
Rights 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
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00362-012-0462-1