Consider a sequence of exchangeable or Markov-dependent binary (zero-one) trials. A
sequence of independent and identically distributed binary trials is covered as a particular …

Consider a sequence of binary (success–failure) random variables (RVs) ordered on a line.
The number of strings with a constrained number of consecutive failures between two …

Consider a finite sequence of independent binary (zero-one) random variables ordered on a
line or on a circle. The number of the ℓ-overlapping runs of ones of a fixed length k is studied …

In an infinite sequence of independent Bernoulli trials with success probabilities pk= a/(a+
b+ k-1) for k= 1, 2, 3,…, let Nr be the number of r≥ 2 consecutive successes. Expressions for …

In an infinite sequence of independent identically distributed continuous random variables
we study the number of strings of two subsequent records interrupted by a given number of …

A NOTE ON EMBEDDING CERTAIN BERNOULLI SEQUENCES IN MARKED POISSON
PROCESSES Page 1 J. Appl. Prob. 45, 1181–1185 (2008) Printed in England © Applied …

In a 0-1 sequence of Markov dependent trials we consider a statistic which counts strings of
a limited length run of 0s between subsequent 1s. Its probability mass function is used to …

A sequence of random variables, each taking only two values “0” or “1,” is called a Bernoulli
sequence. Consider the counts of occurrences of strings of the form {11},{101},{1001},… in …

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 (eg, records …

An infinite sequence (Y1, Y2,…) of independent Bernoulli random variables with P (Yi= 1)=
a/(a+ b+ i-1), i= 1, 2,…, where a> 0 and b≥ 0, will be called a Bern (a, b) sequence …