In this thesis probability distribution of five random variables related to success runs in a sequence of Bernoulli trials was found. The techinque of imbedding random sequences into Markov chains is used and improved compared to existing results. For every run a Markov chain was constructed, the definiton of imbedding was verified, a method for computation of its distribution was stated and examples of distribution were computed.
In a set of n repeated Bernoulli trials where each trial results in an event E, the number of events...
AbstractRecently, Grabner et al. [Combinatorics of geometrically distributed random variables: run s...
Under different popular counting schemes of runs we have obtained probability-generating function (p...
This work is focused on selected probability characteristics of runs in a sequence of Bernoulli tria...
This work is focused on selected probability characteristics of runs in a sequence of Bernoulli tria...
The method of finite Markov chain imbedding developed by Fu and Koutras (1994) has become a popular ...
The probability that a sequence of n Bernoulli trials contains a run of at least k successive l&apos...
The application of the theory of runs to the testing of statistical data is a fairly new method of t...
Consider a sequence of n independent Bernoulli trials with the j-th trial having probability Pj of s...
Presents a method of deriving the limiting distributions of the number of occurences of success (S) ...
A probabilistic analysis of the ascending runs of sequences of geometrically distributed random vari...
22 pages, 1 article*Run Probabilities in Sequences of Markov-Dependent Trials* (Schwager, Steven J.)...
The probability of the occurrence of a run R is obtained as a function of the composition of R, the ...
The conditional distribution theory of the number of runs R in a randomly ordered sequence of length...
Statistical Tests are suitable means for analyzing properties of pseudorandom sequences, specificall...
In a set of n repeated Bernoulli trials where each trial results in an event E, the number of events...
AbstractRecently, Grabner et al. [Combinatorics of geometrically distributed random variables: run s...
Under different popular counting schemes of runs we have obtained probability-generating function (p...
This work is focused on selected probability characteristics of runs in a sequence of Bernoulli tria...
This work is focused on selected probability characteristics of runs in a sequence of Bernoulli tria...
The method of finite Markov chain imbedding developed by Fu and Koutras (1994) has become a popular ...
The probability that a sequence of n Bernoulli trials contains a run of at least k successive l&apos...
The application of the theory of runs to the testing of statistical data is a fairly new method of t...
Consider a sequence of n independent Bernoulli trials with the j-th trial having probability Pj of s...
Presents a method of deriving the limiting distributions of the number of occurences of success (S) ...
A probabilistic analysis of the ascending runs of sequences of geometrically distributed random vari...
22 pages, 1 article*Run Probabilities in Sequences of Markov-Dependent Trials* (Schwager, Steven J.)...
The probability of the occurrence of a run R is obtained as a function of the composition of R, the ...
The conditional distribution theory of the number of runs R in a randomly ordered sequence of length...
Statistical Tests are suitable means for analyzing properties of pseudorandom sequences, specificall...
In a set of n repeated Bernoulli trials where each trial results in an event E, the number of events...
AbstractRecently, Grabner et al. [Combinatorics of geometrically distributed random variables: run s...
Under different popular counting schemes of runs we have obtained probability-generating function (p...
.svg%3Fwidth%3D300&w=3840&q=75)
Add to ORKG