Minimum and maximum distances between failures in binary sequences
From MaRDI portal
Recommendations
- On the mean and extreme distances between failures in Markovian binary sequences
- Shortest and longest length of success runs in binary sequences
- Length of the minimum sequence containing repeats of success runs
- Success run statistics defined on an urn model
- Exact distributions of constrained (k, ) strings of failures between subsequent successes
Cites work
- A Full Likelihood Procedure for Analysing Exchangable Binary Data
- Consecutive k-within-m-out-of-n:F system with exchangeable components
- Constrained (k,d)-out-of-n systems
- Counts of Failure Strings in Certain Bernoulli Sequences
- Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Lengths of runs and waiting time distributions by using Pólya-Eggenberger sampling scheme
- Mixture representations for the reliability of consecutive-\(k\) systems
- On a waiting time distribution in a sequence of Bernoulli trials
- Reliability of a consecutive k-out-of-r-from-n:F system
- Runs and scans with applications
- Scan statistics and applications
- Shortest and longest length of success runs in binary sequences
- Success run statistics defined on an urn model
- Waiting time distributions of runs in higher order Markov chains
- Waiting times for patterns in a sequence of multistate trials
Cited in
(7)- Length of the minimum sequence containing repeats of success runs
- Exact distributions of constrained (k, ) strings of failures between subsequent successes
- Shortest and longest length of success runs in binary sequences
- On -overlapping runs of ones of length k in sequences of independent binary random variables
- scientific article; zbMATH DE number 5494664 (Why is no real title available?)
- On the mean and extreme distances between failures in Markovian binary sequences
- Minimum degree and density of binary sequences
This page was built for publication: Minimum and maximum distances between failures in binary sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631539)