A study of counts of Bernoulli strings via conditional Poisson processes
Preprint
Abstract
We say that a string of length $d$ occurs, in a Bernoulli sequence, if a success is followed by exactly $(d-1)$ failures before the next success. The counts of such $d$-strings are of interest, and in specific independent Bernoulli sequences are known to correspond to asymptotic $d$-cycle counts in random permutations. In this note, we give a new framework, in terms of conditional Poisson processes, which allows for a quick characterization of the joint distribution of the counts of all $d$-strings, in a general class of Bernoulli sequences, as certain mixtures of the product of Poisson measures. This general class includes all Bernoulli sequences considered before, as well many new sequences.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- On Sums of Products of Bernoulli Variables and Random PermutationsJournal of Theoretical Probability, 2004
- Logarithmic Combinatorial Structures: A Probabilistic Approach2003
- Distribution of the number of consecutive recordsRandom Structures & Algorithms, 2000
- Poisson Process Approximations for the Ewens Sampling FormulaThe Annals of Applied Probability, 1992
- The Cycle Structure of Random PermutationsThe Annals of Probability, 1992
- Contributions to the Theory of Dirichlet ProcessesThe Annals of Probability, 1973
- A problem of the Allocation of Particles in Cells and Cycles of Random PermutationsTheory of Probability & Its Applications, 1971
- The fundamental limit theorems in probabilityBulletin of the American Mathematical Society, 1945