The expected number of 0-1 strings of a limited length is a potentially useful index of the behavior of stochastic processes describing the occurrence of critical events (e.g., records, extremes, and exceedances). Such model sequences might be derived by a Hoppe-Polya or a Polya-Eggenberger urn model interpreting the drawings of white balls as occurrences of critical events. Numerical results, concerning average numbers of constrained length interruptions of records as well as how on the average subsequent exceedances are separated, demonstrate further certain urn models. 1. Introduction and Preliminaries Recently, some researches associated with the number of patterns which consist of runs of zeros (s) between subsequent ones (s) in sequences of binary random variables (RVs) have appeared in the literature. The 0-1 sequences may have several internal structures including among others sequences of independent but not necessarily identically distributed (INID) RVs, with , , and , , and sequences of exchangeable (EXCH) or symmetrically dependent RVs, the joint distribution of which is invariant under any permutation of its arguments; that is, for any and any vector , , it holds that for any permutation of the set and . A common ground for both INID and EXCH sequences is sequences of independent and identically distributed (IID) RVs with probability of s , , since an IID sequence is an INID sequence with or an EXCH sequence with . In population genetics and evolution of species, urn models are frequently used as probabilistic models/devices to explain/apply some theories. Among the plethora of such models (see, e.g., Johnson and Kotz [1], Blom et al. [2], and Mahmoud [3]) we consider in the sequel two of them: the Hoppe-Polya urn model () and the Polya-Eggenberger urn model (). The first one, introduced by Holst [4, 5] as a generalization of the Hoppe urn model, is a device to produce certain INID binary sequences whereas the second one supplies a mechanism for producing particular EXCH binary sequences. Special cases of are models of a () fixed/random threshold (see, e.g., Eryilmaz and Yalcin [6], Makri and Psillakis [7], and Eryilmaz et al. [8]), whereas a special case of is the (RIM) record indicator model (see, e.g., Holst [5, 9, 10], Demir and Ery?lmaz [11], and Makri and Psillakis [7]). and find potential applications in the frequency analysis and risk managing of the occurrence of critical events (records, extremes, and exceedances) in several scientific disciplines like physical sciences (e.g., seismology, meteorology, and hydrology) and stochastic
References
[1]
N. L. Johnson and S. Kotz, Urn Models and Their Applications, John Wiley & Sons, New York, NY, USA, 1977.
[2]
G. Blom, L. Holst, and D. Sandell, Problems and Snapshots from the World of Probability, Springer, New York, NY, USA, 1994.
[3]
H. M. Mahmoud, Polya Urn Models, CRC Press, Boca Raton, Fla, USA, 2009.
[4]
L. Holst, “Counts of failure strings in certain Bernoulli sequences,” Journal of Applied Probability, vol. 44, no. 3, pp. 824–830, 2007.
[5]
L. Holst, “The number of two consecutive successes in a Hoppe-Pólya urn,” Journal of Applied Probability, vol. 45, no. 3, pp. 901–906, 2008.
[6]
S. Eryilmaz and F. Yalcin, “On the mean and extreme distances between failures in Markovian binary sequences,” Journal of Computational and Applied Mathematics, vol. 236, no. 6, pp. 1502–1510, 2011.
[7]
F. S. Makri and Z. M. Psillakis, “On success runs of length exceeded a threshold,” Methodology and Computing in Applied Probability, vol. 13, no. 2, pp. 269–305, 2011.
[8]
S. Eryilmaz, O. L. Gebizlioglu, and F. Tank, “Modeling of claim exceedances over random thresholds for related insurance portfolios,” Insurance: Mathematics & Economics, vol. 49, no. 3, pp. 496–500, 2011.
[9]
L. Holst, “On consecutive records in certain Bernoulli sequences,” Journal of Applied Probability, vol. 46, no. 4, pp. 1201–1208, 2009.
[10]
L. Holst, “A note on records in a random sequence,” Arkiv for Matematik, vol. 49, no. 2, pp. 351–356, 2011.
[11]
S. Demir and S. Ery?lmaz, “Run statistics in a sequence of arbitrarily dependent binary trials,” Statistical Papers, vol. 51, no. 4, pp. 959–973, 2010.
[12]
A. Sarkar, K. Sen, and Anuradha, “Waiting time distributions of runs in higher order Markov chains,” Annals of the Institute of Statistical Mathematics, vol. 56, pp. 317–349, 2004.
[13]
K. Sen and B. Goyal, “Distributions of patterns of two failures separated by success runs of length ,” Journal of the Korean Statistical Society, vol. 33, no. 1, pp. 35–58, 2004.
[14]
S. D. Dafnis, A. N. Philippou, and D. L. Antzoulakos, “Distributions of patterns of two successes separated by a string of -2 failures,” Statistical Papers, vol. 53, no. 2, pp. 323–344, 2012.
[15]
F. W. Huffer and J. Sethuraman, “Joint distributions of counts of strings in finite Bernoulli sequences,” Journal of Applied Probability, vol. 49, no. 3, pp. 758–772, 2012.
[16]
F. S. Makri and Z. M. Psillakis, “Counting certain binary strings,” Journal of Statistical Planning and Inference, vol. 142, no. 4, pp. 908–924, 2012.
[17]
E. Zehavi and J. K. Wolf, “On runlength codes,” IEEE Transactions on Information Theory, vol. 34, no. 1, pp. 45–54, 1988.
[18]
P. Jacquet and W. Szpankowski, “On (d,k) sequences not containing a given word,” in Proceedings of the International Symposium on Information Theory, pp. 1486–1489, 2006.
[19]
V. T. Stefanov and W. Szpankowski, “Waiting time distributions for pattern occurrence in a constrained sequence,” Discrete Mathematics & Theoretical Computer Science, vol. 9, no. 1, pp. 305–320, 2007.
[20]
H. H. Chern, H. K. Hwang, and Y. N. Yeh, “Distribution of the number of consecutive records,” Random Structures and Algorithms, vol. 17, pp. 169–196, 2000.
[21]
A. Joffe, E. Marchand, F. Perron, and P. Popadiuk, “On sums of products of Bernoulli variables and random permutations,” Journal of Theoretical Probability, vol. 17, no. 1, pp. 285–292, 2004.
[22]
H.-H. Chern and H.-K. Hwang, “Limit distribution of the number of consecutive records,” Random Structures & Algorithms, vol. 26, no. 4, pp. 404–417, 2005.
[23]
L. Holst, “A note on embedding certain Bernoulli sequences in marked Poisson processes,” Journal of Applied Probability, vol. 45, no. 4, pp. 1181–1185, 2008.
[24]
F. W. Huffer, J. Sethuraman, and S. Sethuraman, “A study of counts of Bernoulli strings via conditional Poisson processes,” Proceedings of the American Mathematical Society, vol. 137, no. 6, pp. 2125–2134, 2009.
[25]
S. Eryilmaz and M. Zuo, “Constrained -out-of- systems,” International Journal of Systems Science, vol. 41, no. 6, pp. 679–685, 2010.
[26]
F. S. Makri, “Minimum and maximum distances between failures in binary sequences,” Statistics & Probability Letters, vol. 81, no. 3, pp. 402–410, 2011.
[27]
S. D. Dafnis and A. N. Philippou, “Distributions of patterns with applications in engineering,” IAENG International Journal of Applied Mathematics, vol. 41, no. 1, pp. 68–75, 2011.
[28]
F. S. Makri and Z. M. Psillakis, “Exact distributions of constrained (k, ?) strings of failures between subsequent successes,” Statistical Papers, vol. 54, no. 3, pp. 783–806, 2013.