Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-14T16:20:53.956Z Has data issue: false hasContentIssue false
  • English
  • Français

Counts of Failure Strings in Certain Bernoulli Sequences

Part of:Special processesCombinatorial probability

Published online by Cambridge University Press:  14 July 2016

Lars Holst
Lars Holst*
Affiliation:
Royal Institute of Technology
*
∗ Postal address: Department of Mathematics, Royal Institute of Technology, SE-10044 Stockholm, Sweden. Email address: lholst@math.kth.se
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.

In a sequence of independent Bernoulli trials the probability for success in the kth trial is p k , k = 1, 2, …. The number of strings with a given number of failures between two subsequent successes is studied. Explicit expressions for distributions and moments are obtained for the case in which p k = a/(a + b + k − 1), a > 0, b ≥ 0. Also, the limit behaviour of the longest failure string in the first n trials is considered. For b = 0, the strings correspond to cycles in random permutations.

Keywords

Binomial momentEwens sampling formulaHoppe's urnPoisson distributionPoisson-Dirichlet distributionPólya's urnrandom permutationrecordspacingsums of indicators

MSC classification

Secondary:60C05: Combinatorial probability60K99: None of the above, but in this section

Information

Type
Research Article
Information
Journal of Applied Probability , Volume 44 , Issue 3 , September 2007, pp. 824 - 830
Copyright
Copyright © Applied Probability Trust 2007 

References

Arratia, R., Barbour, A. D. and Tavaré, S. (2003). Logarithmic Combinatorial Structures: a Probabilistic Approach. European Mathematical Society Publishing House, ETH-Zentrum, Zürich.CrossRefGoogle Scholar
Chern, H.-H., Hwang, H.-K. and Yeh, Y.-N. (2000). Distribution of the number of consecutive records. Random Structures Algorithms 17, 169–196.Google Scholar
Gnedin, A. (2007). Coherent random permutations with record statistics. To appear in Discrete Math. Theoret. Comput. Sci. CrossRefGoogle Scholar
Hahlin, L. O. (1995). Double Records. Res. Rep. 1995:12, Department of Mathematics, Uppsala University.Google Scholar
Holst, L. (2006). On the number of consecutive successes in Bernoulli trials. Preprint.Google Scholar
Joffe, A., Marchand, E., Perron, F. and Popadiuk, P. (2004). On sums of products of Bernoulli variables and random permutations. J. Theoret. Prob. 17, 285–292.Google Scholar
Knuth, D. (1992). Two notes on notations. Amer. Math. Monthly 99, 403–422.CrossRefGoogle Scholar
Mori, T. F. (2001). On the distribution of sums of overlapping products. Acta Scientiarum Mathematica (Szeged) 67, 833–841.Google Scholar
Sethuraman, J. and Sethuraman, S. (2004). On counts of Bernoulli strings and connections to rank orders and random permutations. In A festschrift for Herman Rubin (IMS Lecture Notes Monogr. Ser. 45), Institute of Mathematical Statistics, Beachwood, OH, pp. 140–152.CrossRefGoogle Scholar