This work is focused on selected probability characteristics of runs in a sequence of Bernoulli trials and on some randomness tests based on these runs. Based on Markov chains, an explicit formula is derived for the probability that the first success run of a lenght $k$ in a sequence of independent Bernoulli trials occurs in the $n$-th trial and other formulas for this probability are mentioned. Furthermore, approximations of the exact value of this probability (particularly the Feller approximation), bounds of these approximations, and their numeric relations are examined. Lastly, a test of randomness based on the lenght of the longest run in a sequence of $n$ Bernoulli trials and a test based on the total amount of runs are derived
In a recent paper, the authors derived the exact solution for the probability mass function of the g...
Abstract. The problem of estimating the number, n, of trials, given a sequence of k independent succ...
Let N(k)n denote the number of success runs of length k ([greater-or-equal, slanted] 1) in n Bernoul...
This work is focused on selected probability characteristics of runs in a sequence of Bernoulli tria...
The probability that a sequence of n Bernoulli trials contains a run of at least k successive l&apos...
In this thesis probability distribution of five random variables related to success runs in a sequen...
The probability distribution of the number of success runs of length k ([greater-or-equal, slanted]1...
Presents a method of deriving the limiting distributions of the number of occurences of success (S) ...
The method of finite Markov chain imbedding developed by Fu and Koutras (1994) has become a popular ...
Consider a sequence of n independent Bernoulli trials with the j-th trial having probability Pj of s...
AbstractConsider a sequence of n Bernoulli (Success–Failure or 1–0) trials. The exact and limiting d...
We consider the longest run of either successes or failures in a sequence of (Formula presented.) Be...
We propose a data driven test to identify first order positive Markovian dependence in a Bernoulli s...
The Bernoulli distribution is a basic, well-studied distribution in probability. In this thesis, we ...
The problem of estimating the number, n, of trials, given a sequence of k independent success counts...
In a recent paper, the authors derived the exact solution for the probability mass function of the g...
Abstract. The problem of estimating the number, n, of trials, given a sequence of k independent succ...
Let N(k)n denote the number of success runs of length k ([greater-or-equal, slanted] 1) in n Bernoul...
This work is focused on selected probability characteristics of runs in a sequence of Bernoulli tria...
The probability that a sequence of n Bernoulli trials contains a run of at least k successive l&apos...
In this thesis probability distribution of five random variables related to success runs in a sequen...
The probability distribution of the number of success runs of length k ([greater-or-equal, slanted]1...
Presents a method of deriving the limiting distributions of the number of occurences of success (S) ...
The method of finite Markov chain imbedding developed by Fu and Koutras (1994) has become a popular ...
Consider a sequence of n independent Bernoulli trials with the j-th trial having probability Pj of s...
AbstractConsider a sequence of n Bernoulli (Success–Failure or 1–0) trials. The exact and limiting d...
We consider the longest run of either successes or failures in a sequence of (Formula presented.) Be...
We propose a data driven test to identify first order positive Markovian dependence in a Bernoulli s...
The Bernoulli distribution is a basic, well-studied distribution in probability. In this thesis, we ...
The problem of estimating the number, n, of trials, given a sequence of k independent success counts...
In a recent paper, the authors derived the exact solution for the probability mass function of the g...
Abstract. The problem of estimating the number, n, of trials, given a sequence of k independent succ...
Let N(k)n denote the number of success runs of length k ([greater-or-equal, slanted] 1) in n Bernoul...