Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-10T20:44:25.420Z Has data issue: false hasContentIssue false
  • English
  • Français

On Occurrences of F-S Strings in Linearly and Circularly Ordered Binary Sequences

Part of: Combinatorial probability Distribution theory - Probability Stochastic processes Limit theorems Distribution theory

Published online by Cambridge University Press:  14 July 2016

Frosso S. Makri
Frosso S. Makri*
Affiliation:
University of Patras
*
∗Postal address: Department of Mathematics, University of Patras, 26500 Patras, Greece. Email address: makri@math.upatras.gr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Consider a sequence of exchangeable or independent binary trials ordered on a line or on a circle. The statistics denoting the number of times an F-S string of length (at least) k1 + k2, that is, (at least) k1 failures followed by (at least) k2 successes in n such trials, are studied. The associated waiting time for the rth occurrence of an F-S string of length (at least) k1 + k2 in linearly ordered trials is also examined. Exact formulae, lower/upper bounds and approximations are derived for their distributions. Mean values and variances of the number of occurrences of F-S strings are given in exact formulae too. Particular exchangeable and independent sequences of binary random variables, used in applied research, combined with numerical examples clarify further the theoretical results.

Keywords

Distribution of order (k1, k2)linear and circular binary sequencesexchangeable trialPoisson trialurn modelrecordsruns

MSC classification

Secondary: 60E05: Distributions 62E15: Exact distribution theory 60C05: Combinatorial probability 60G09: Exchangeability 60F05: Central limit and other weak theorems
Type
Research Article
Information
Journal of Applied Probability , Volume 47 , Issue 1 , March 2010 , pp. 157 - 178
Copyright
Copyright © Applied Probability Trust 2010 

References

Alevizos, P. D., Papastavridis, S. G. and Sypsas, P. (1993). Reliability of cyclic m-consecutive-k-out-of-n:F systems. In Proc. 2nd IASTED Int. Conf. Reliability, Quality Control, and Risk Assessment, IASTED-ACTA Press, Anaheim, pp. 140–143.Google Scholar
Antzoulakos, D. L., Bersimis, S. and Koutras, M. V. (2003). On the distribution of the total number of run lengths. Ann. Inst. Statist. Math. 55, 865–884.CrossRefGoogle Scholar
Arratia, R., Goldstein, L. and Gordon, L. (1989). Two moments suffice for Poisson approximations: the Chen–Stein method. Ann. Prob. 17, 9–25.CrossRefGoogle Scholar
Balakrishnan, N. and Koutras, M. V. (2002). Runs and Scans with Applications. John Wiley, New York.Google Scholar
Charalambides, C. A. (1994). Success runs in a circular sequence of independent Bernoulli trials. In Runs and Patterns in Probability, eds Godbole, A. P. and Papastavridis, S. G., Kluwer, Dordrecht, pp. 15–30.CrossRefGoogle Scholar
Charalambides, C. A. (2002). Enumerative Combinatorics. Chapman and Hall/CRC, Boca Raton, FL.Google Scholar
Chern, H.-H. and Hwang, H.-K. (2005). Limit distribution of the number of consecutive records. Random Structures Algorithms 26, 404–417.CrossRefGoogle Scholar
Demir, S. and Eryilmaz, S. (2008). Run statistics in a sequence of arbitrarily dependent binary trials. To appear in Statist. Papers.Google Scholar
Eryilmaz, S. (2008). Run statistics defined on the multicolor urn model. J. Appl. Prob. 45, 1007–1023.CrossRefGoogle Scholar
Eryilmaz, S. (2009). Mean success run length. J. Korean Statist. Soc. 38, 65–71.CrossRefGoogle Scholar
Eryilmaz, S. and Demir, S. (2007). Success runs in a sequence of exchangeable binary trials. J. Statist. Planning Infer. 137, 2954–2963.CrossRefGoogle Scholar
Eryilmaz, S. and Tutuncu, G. Y. (2002). Success run model based on records. J. Statist. Theory Appl. 1, 75–81.Google Scholar
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd edn. John Wiley, New York.Google Scholar
Fu, J. C. and Lou, W. Y. W. (2003). Distribution Theory of Runs and Patterns and Its Applications. World Scientific, River Edge, NJ.CrossRefGoogle Scholar
George, E. O. and Bowman, D. (1995). A full likelihood procedure for analysing exchangeable binary data. Biometrics 51, 512–523.CrossRefGoogle ScholarPubMed
Godbole, A. P. and Schaffner, A. A. (1993). Improved Poisson approximations for word patterns. Adv. Appl. Prob. 25, 334–347.CrossRefGoogle Scholar
Hirano, K. (1986). Some properties of the distributions of order k. In Fibonacci Numbers and Their Applications, eds Philippou, A. N., Horadam, A. F. and Bergum, G. E., Reidel, Dordrecht, pp. 43–53.CrossRefGoogle Scholar
Hoeffding, W. and Robbins, H. (1948). The central limit theorem for dependent random variables. Duke Math. J. 15, 773–780.CrossRefGoogle Scholar
Huang, W. T. and Tsai, C. S. (1991). On a modified binomial distribution of order k. Statist. Prob. Lett. 11, 125–131.CrossRefGoogle Scholar
Johnson, N. and Kotz, S. (1977). Urn Models and Their Applications. John Wiley, New York.Google Scholar
Kendall, D. G. (1967). On finite and infinite sequences of exchangeable events. Studia Sci. Math. Hung. 2, 319–327.Google Scholar
Koutras, M. V. (2003). Applications of Markov chains to the distribution theory of runs and patterns. In Stochastic Processes: Modelling and Simulation (Handbook Statist. 21), eds Shanbhag, D. N. and Rao, C. R., North-Holland, Amsterdam, pp. 431–472.CrossRefGoogle Scholar
Koutras, M. V., Papadopoulos, G. K. and Papastavridis, S. G. (1995). Runs on a circle. J. Appl. Prob. 32, 396–404.CrossRefGoogle Scholar
Makri, F. S. and Philippou, A. N. (1994). Binomial distributions of order k on the circle. In Runs and Patterns in Probability, eds Godbole, A. P. and Papastavridis, S. G., Kluwer, Dordrecht, pp. 65–81.CrossRefGoogle Scholar
Makri, F. S. and Philippou, A. N. (2005). On binomial and circular binomial distributions of order k for ℓ-overlapping success runs of length k . Statist. Papers 46, 411–432.CrossRefGoogle Scholar
Makri, F. S., Philippou, A. N. and Psillakis, Z. M. (2007a). Pólya, inverse Pólya, and circular Pólya distributions of order k for ℓ-overlapping success runs. Commun. Statist. Theory Meth. 36, 657–668.CrossRefGoogle Scholar
Makri, F. S., Philippou, A. N. and Psillakis, Z. M. (2007b). Success run statistics defined on an urn model. Adv. Appl. Prob. 39, 991–1019.CrossRefGoogle Scholar
Makri, F. S. and Psillakis, Z. M. (2009a). On success runs of length exceeded a threshold. To appear in Methodology Comput. Appl. Prob. CrossRefGoogle Scholar
Makri, F. S. and Psillakis, Z. M. (2009b). On runs of length exceeding a threshold: normal approximation. To appear in Statist. Papers.CrossRefGoogle Scholar
Nevzorov, V. B. (2001). Records: Mathematical Theory. American Mathematical Society, Providence, RI.Google Scholar
Philippou, A. N. and Makri, F. S. (1986). Successes, runs and longest runs. Statist. Prob. Lett. 4, 211–215.CrossRefGoogle Scholar
Philippou, A. N. and Makri, F. S. (1990). Longest circular runs with an application to reliability via Fibonacci-type polynomials of order k. In Applications of Fibonacci Numbers, eds Bergum, E. G. et al., Kluwer, Dordrecht, pp. 281–286.CrossRefGoogle Scholar
Philippou, A. N. and Muwafi, A. A. (1982). Waiting for the kth consecutive success and the Fibonacci sequence of order k. Fibonacci Quart. 20, 28–32.Google Scholar
Philippou, A. N., Georgiou, C. and Philippou, G. N. (1983). A generalized geometric distribution and some of its properties. Statist. Prob. Lett. 1, 171–175.CrossRefGoogle Scholar
Sen, K., Agarwal, M. and Bhattacharya, S. (2006). Pólya–Eggenberger F-S models of order (k_{1},k_{2}). Studia Sci. Math. Hung. 43, 1–31.Google Scholar
Vellaisamy, P. (2004). Poisson approximation for (k_{1},k_{2})-events via the Stein–Chen method. J. Appl. Prob. 41, 1081–1092.Google Scholar