Minimum and maximum distances between failures in binary sequences
From MaRDI portal
Publication:631539
DOI10.1016/J.SPL.2010.11.020zbMath1210.60019OpenAlexW2028970574MaRDI QIDQ631539
Publication date: 14 March 2011
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2010.11.020
Exact distribution theory in statistics (62E15) Probability distributions: general theory (60E05) Combinatorial probability (60C05)
Related Items (4)
On ℓ-overlapping Runs of Ones of Lengthkin Sequences of Independent Binary Random Variables ⋮ Exact distributions of constrained \((k, \ell )\) strings of failures between subsequent successes ⋮ On the mean and extreme distances between failures in Markovian binary sequences ⋮ Length of the minimum sequence containing repeats of success runs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixture representations for the reliability of consecutive-\(k\) systems
- Scan statistics and applications
- On a waiting time distribution in a sequence of Bernoulli trials
- Waiting time distributions of runs in higher order Markov chains
- Shortest and longest length of success runs in binary sequences
- Waiting times for patterns in a sequence of multistate trials
- Constrained (k,d)-out-of-nsystems
- Reliability of a consecutive k-out-of-r-from-n:F system
- Lengths of runs and waiting time distributions by using Pólya-Eggenberger sampling scheme
- A Full Likelihood Procedure for Analysing Exchangable Binary Data
- Consecutive k‐within‐m‐out‐of‐n:F system with exchangeable components
- Counts of Failure Strings in Certain Bernoulli Sequences
- Success run statistics defined on an urn model
This page was built for publication: Minimum and maximum distances between failures in binary sequences
