Abstract
Let {Z i }i≥1 be an arbitrary sequence of trials with two possible outcomes either success (1) or failure (0). General expressions for the exact distributions of runs, both success and failure, in Z 1, . . . , Z n are presented. Our method is based on the use of joint distribution of success and failure run lengths and unifies the results on distribution of runs. As a special case of our results we obtain the distributions of runs for various binary sequences. As illustrated in the paper the results enable us to derive the distribution of runs for binary trials arising in urn models.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Balakrishnan N, Koutras MV (2002) Runs and scans with applications. Wiley Series in probability and statistics, New York
Blom G, Holst L, Sandell D (1994) Problems and snapshots from the world of probability. Springer, New York
Charalambides CA (2002) Enumerative combinatorics. Chapman and Hall/CRC, London
Chern H-H, Hwang H-K, Yeh Y-N (2000) Distribution of the number of consecutive records. Random Struct Algorithms 17: 169–196
Chern H-H, Hwang H-K (2005) Limit distribution of the number of consecutive records. Random Struct Algorithms 26: 404–417
Eggenberger F, Pólya G (1923) Über die Statistik verketteter Vorgänge. Z. für Ang. Math. und Mech. 3: 279–289
Eryılmaz S (2005) On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials. Stat Papers 46: 117–128
Eryılmaz S, Demir S (2007) Success runs in a sequence of exchangeable binary trials. J Stat Planning Inference 137: 2954–2963
Eryılmaz S (2008a) Distribution of runs in a sequence of exchangeable multistate trials. Stat Probab Lett 78: 1505–1513
Eryılmaz S (2008b) Run statistics defined on the multicolor urn model. J Appl Probab (to appear)
Fu JC, Lou WYW (2003) Distribution theory of runs and patterns and its applications. A finite markov chain imbedding technique. World Scientific Pub., USA
Gibbons JD, Chakraborti S (2003) Nonparametric statistical inference, 4th edn. Marcel Dekker, New York
Johnson N, Kotz S (1977) Urn models and their application: an approach to modern discrete probability theory. Wiley, New York
Kong Y (2006) Distribution of runs and longest runs: a new generating function approach. J Am Stat Assoc 101: 1253–1263
Makri FS, Philippou AN (2005) On binomial and circular binomial distributions of order k for l-overlapping success runs of length k. Stat Papers 46: 411–432
Makri FS, Philippou AN, Psillakis ZM (2007a) Shortest and longest length of success runs in binary sequences. J Stat Planning Inference 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, Philippou AN, Psillakis ZM (2007c) Pólya, inverse Pólya, and circular Pólya distributions of order k for l -overlapping success runs. Commun Stat Theory Methods 36: 657–668
Nevzorov VB (2001) Records: mathematical theory. American Mathematical Society, Rhode Island
Sen K, Agarwal ML, Chakraborty S (2002) Lengths of runs and waiting time distributions by using Pólya–Eggenberger sampling scheme. Studia Sci Math Hungar 39: 309–332
Styve B (1965) A variant of Pólya urn model. Nordisk Mat Tidsk 13: 147–152
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Demir, S., Eryılmaz, S. Run statistics in a sequence of arbitrarily dependent binary trials. Stat Papers 51, 959–973 (2010). https://doi.org/10.1007/s00362-008-0191-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00362-008-0191-7