Abstract
Let \({\{ X_{i}\} _{i\geq 1}}\) be an infinite sequence of recurrent partially exchangeable binary random variables. We study the exact distributions of two run statistics (total number of success runs and the longest success run) in \({\{ X_{i}\} _{i\geq1}}\) . Since a flexible class of models for binary sequences can be obtained using the concept of partial exchangeability, as a special case of our results one can obtain the distribution of runs in ordinary Markov chains, exchangeable and independent sequences. The results also enable us to study the distribution of runs in particular urn models.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
De Finetti B (1931) Funzione caratteristica di un fenomeno allatorio. Attidella R. Accademia Nazionale dei Lincii Ser. 6, Memorie, Classe di Scienze, Fisiche, Matematiche e Naturali 4:251–299
De Finetti B (1974) Probability, induction and statistics. Wiley, New York
Demir S, Eryılmaz S (2009) Run statistics in a sequence of arbitrarily dependent binary trials. Stat Papers. doi:10.1007/s00362-008-0191-7
Diaconis P, Freedman D (1980) De Finetti’s theorem for Markov chains. Ann Probab 8: 115–130
Durrett RT (1991) Probability: theory and examples. Wadsworth & Brooks/Cole, Pacific Grove, California
Eryılmaz S (2008a) Distribution of runs in a sequence of exchangeable multi-state trials. Stat Probab Lett 78: 1505–1513
Eryılmaz S (2008b) Run statistics defined on the multicolor urn model. J Appl Probab 45: 1007–1023
Eryılmaz S (2009) Mean success run length. J Korean Stat Soc 38: 65–71
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
Freedman DA (1962) Invariants under mixing which generalize de Finetti’s theorem. Ann Math Stat 33: 916–923
Kong Y (2006) Distribution of runs and longest runs: a new generating function approach. J Am Stat Assoc 101: 1253–1263
Mahmoud HM (2009) Pólya urn models. Chapman & Hall, London
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 Prob 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
Quintana FA, Newton MA (1998) Assessing the order of dependence for partially exchangeable data. J Am Stat Assoc 93(441): 194–202
Quintana FA, Newton MA (1999) Parametric partially exchangeable models for multiple binary seqeunces. Braz J Probab Stat 13: 55–76
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
Sen K, Agarwal M, Bhattacharya S (2003) On circular distributions of order k based on Pólya–Eggenberger sampling scheme. J Math Sci 2: 34–54
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Eryılmaz, S., Yalçın, F. Distribution of run statistics in partially exchangeable processes. Metrika 73, 293–304 (2011). https://doi.org/10.1007/s00184-009-0278-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00184-009-0278-8