Abstract
Consider a sequence of n two state (success-failure) trials with outcomes arranged on a line or on a circle. The elements of the sequence are independent (identical or non identical distributed), exchangeable or first-order Markov dependent (homogeneous or non homogeneous) random variables. The statistic denoting the number of success runs of length at least equal to a specific length (a threshold) is considered. Exact formulae, lower/upper bounds and approximations are obtained for its probability distribution. The mean value and the variance of it are derived in an exact form. The distributions and the means of an associated waiting time and the length of the longest success run are provided. The reliability function of certain general consecutive systems is deduced using specific probabilities of the studied statistic. Detailed application case studies, covering a wide variety of fields, are combined with extensive numerical experimentation to illustrate further the theoretical results.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Agarwal M, Sen K, Mohan P (2007) GERT analysis of m-consecutive-k-out-of-n systems. IEEE Trans Reliab 56:26–34
Agin MA, Godbole AP (1992) A new exact runs test for randomness. In: Page C, Le Page R (eds) Computing science and statistics, proceedings of the 22nd symposium on the interface. Springer, New York, pp 281–285
Antzoulakos DL, Bersimis S, Koutras MV (2003) On the distribution of the total number of run lengths. Ann Inst Stat Math 55:865–884
Antzoulakos DL, Boutsikas MV (2007) A direct method to obtain the joint distribution of successes, failures and patterns in enumeration problems. Stat Probab Lett 77:32–39
Antzoulakos DL, Chadjikonstantinidis 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
Binswanger K, Embrechts P (1994) Longest runs in coin tossing. Insur Math Econ 15:139–149
Boutsikas MV, Koutras MV (2002) Modeling claim exeedances over thresholds. Insur Math Econ 30:67–83
Charalambides CA (1994) Success runs in a circular sequence of independent Bernoulli trias. In: Godbole AP, Papastavridis SG (eds) Runs and patterns in probability. Kluwer, Amsterdam, pp 15–30
Charalambides CA (2002) Enumerative combinatorics. Chapmann and Hall/CRC, Boca Raton
David HA, Nagaraja HN (2003) Order statistics. Wiley, New York
Derman C, Lieberman GJ, Ross SM (1982) On the consecutive-k-out-of-n:F system. IEEE Trans Reliab 31:57–63
Eryilmaz S (2005a) The longest run statistic associated with exchangeable binary variables. Turk J Eng Environ Sci 29:105–111
Eryilmaz S (2005b) On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials. Stat Pap 46:117–128
Eryilmaz S (2006) Some results associated with the longest run statistic in a sequence of Markov dependent trials. Appl Math Comput 175:119–130
Eryilmaz S (2008) Reliability properties of consecutive k-out-of-n systems of arbitrarily dependent components. Reliab Eng Syst Saf 94:350–356
Eryilmaz S, Demir S (2007) Success runs in an sequence of exchangeable binary trials. J Stat Plan Inference 137:2954–2963
Eryilmaz S, Tutuncu GY (2002) Success run model based on records. J Stat Theory Appl 1:75–81
Feller W (1968) An introduction to probability theory and its applications, vol 1, 3rd edn. Wiley, New York
Fu JC, Koutras MV (1994) Distribution theory of runs: A Markov chain approach. J Am Stat Assoc 89:1050–1058
Fu JC, Lou WY (2003) Distribution theory of runs and patterns and its applications: a finite Markov imbedding approach. World Scientific, Hackensack
Fu JC, Lou WY (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
Fu JC, Lou WY, Bai ZD, Li G (2002) The exact and limiting distributions for the number of successes in success runs within a sequence of Markov-dependent two-state trials. Ann Inst Stat Math 54:719–730
Fu JC, Wang L, Lou WY (2003) On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials. J Appl Probab 40:346–360
George EO, Bowman D (1995) A full likelihood procedure for analysing exchangeable binary data. Biometrics 51:512–523
Goldstein L (1990) Poisson approximation in DNA sequence matching. Commun Stat Theory Methods 19:4167–4179
Heath D, Sudderth W (1976) De Finetti’s theorem on exchangeable variables. Am Stat 30:188–189
Hirano K, Aki S (1993) On number of occurrences of success runs of specified length in a two-state Markov chain. Stat Sin 3:313–320
Hwang FK (1986) Simplified reliabilities for consecutive-k-out-of-n:F system. SIAM J Algebr Discrete Methods 7:258–264
Johnson NL, Kotz S (1977) Urn models and their applications. Wiley, New York
Kanji GK (2001) 100 Statistical tests. Sage, London
Kontoleon JM (1980) Reliability determination of r-successive-out-of-n:F system. IEEE Trans Reliab 29:437
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 Science B.V., Amsterdam, pp 431–472
Koutras MV, Alexandrou VA (1997) Non-parametric randomness tests based on success runs of fixed length. Stat Probab Lett 32:393–404
Kuo W, Zuo MJ (2003) Optimal reliability modeling: principles and applications. Wiley, Hoboken
Lambiris M, Papastavridis SG (1985) Exact reliability formulas for linear and circular consecutive-k-out-of-n:F systems. IEEE Trans Reliab 34:124–126
Makri FS, Philippou AN (1994) Binomial distributions of order k on the circle. In: Godbole AP, Papastavridis SG (eds) Runs and patterns in probability. Kluwer, Amsterdam, pp 65–81
Makri FS, Philippou AN, Psillakis ZM (2007a) Shortest and longest length of success runs in binary sequences. J Stat Plan Inf 137:2226–2239
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 (1997) Bounds for reliability of k-within connected-(r,s)-out-of-(m,n) failure systems. Microelectron Reliab 37:1217–1224
Mitzenmacher M, Upfal E (2005) Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press, Cambridge
Mood AM (1940) The distribution theory of runs. Ann Math Stat 11:367–392
Muselli M (1996) Simple expressions for success run distributions in Bernoulli trials. Stat Probab Lett 31:121–128
Muselli M (2000a) Useful inequalities for the longest run distribution. Stat Probab Lett 46:239–249
Muselli M (2000b) New improved bounds for reliability of consecutive-k-out-of-n:F systems. J Appl Probab 37:1164–1170
Nevzorov VB (2001) Records: mathematical theory. American Mathematical Society, Providence
Packell E (1981) The mathematics of games and gambling. The Mathematical Association of America, Random House, New York
Philippou AN, Georgiou C, Philippou GN (1983) A generalized geometric distribution and some of its properties. Stat Probab Lett 1:171–175
Renyi A (1962) Theorie des elements saillants d’une suite d’ observations. Colloquim on Combinatorial Methods in Probability Theory (Math. Inst., Aarhus Univ., Aarhus, Denmark August 1–10), pp 104–117. See also: On the extreme elements of observations. Selected Papers of Alfred Renyi, 3:50–65, Akademiai Kiado, Budapest, 1976
Ross SM (2002) Probability models for computer science. Harcourt/Academic, San Diego
Sarkadi K (1957) On the distribution of the number of exceedances. Ann Math Stat 28:1021–1023
Sen K, Agarwal ML, Bhattacharya S (2003) On circular distributions of order k based on Polya-Eggengerger sampling scheme. J Math Sci 2:34–54
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–332
Sen Z (1991) On the probability of the longest run length in an independent series. J Hydrol 125:37–46
Schuster EF (1991) Distribution theory of runs via exchangeable random variables. Stat Probab Lett 11:379–386
Worsley KJ (1982) An Improved Bonferroni inequality and applications. Biometrica 69:297–302
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Makri, F.S., Psillakis, Z.M. On Success Runs of Length Exceeded a Threshold. Methodol Comput Appl Probab 13, 269–305 (2011). https://doi.org/10.1007/s11009-009-9147-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-009-9147-1
Keywords
- Success runs
- Longest run length
- Waiting time
- Linear and circular binary sequences
- Bernoulli trials
- Poisson trials
- Exchangeable trials
- Markov chain
- Reliability of consecutive systems
- Exceedances
- Polya-Eggenberger sampling scheme