Length of the minimum sequence containing repeats of success runs
From MaRDI portal
Publication:2339519
DOI10.1016/j.spl.2014.09.003zbMath1314.60053OpenAlexW2092146273MaRDI QIDQ2339519
Zaharias M. Psillakis, Frosso S. Makri, Anastasios N. Arapis
Publication date: 1 April 2015
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2014.09.003
Exact distribution theory in statistics (62E15) Probability distributions: general theory (60E05) Combinatorial probability (60C05) Exchangeability for stochastic processes (60G09)
Related Items
A UNIFIED APPROACH TO GENERATING FUNCTIONS BASED ON BELL POLYNOMIALS ⋮ On the concentration of runs of ones of length exceeding a threshold in a Markov chain ⋮ On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence ⋮ On runs of ones defined on a \(q\)-sequence of binary trials ⋮ Distributions of statistics describing concentration of runs in non homogeneous Markov-dependent trials ⋮ On success runs in a sequence of dependent trials with a change point ⋮ Joint distribution of \(k\)-tuple statistics in zero-one sequences of Markov-dependent trials
Cites Work
- Run statistics in a sequence of arbitrarily dependent binary trials
- A study on reliability of coherent systems equipped with a cold standby component
- Distribution of run statistics in partially exchangeable processes
- Minimum and maximum distances between failures in binary sequences
- On runs of length exceeding a threshold: normal approximation
- On the distribution of runs of ones in binary strings
- Non-parametric randomness tests based on success runs of fixed length
- The exact distribution of the \(k\)-tuple statistic for sequence homology
- Circular success and failure runs in a sequence of exchangeable binary trials
- Central limit theorem approximations for the number of runs in Markov-dependent binary sequences
- Geometric distribution of order \(k\) with a reward
- Exact distributions of constrained \((k, \ell )\) strings of failures between subsequent successes
- \(g\)-geometric and \(g\)-binomial distributions of order image
- Success runs in a sequence of exchangeable binary trials
- The Number of Two Consecutive Successes in a Hoppe-Pólya Urn
- Distribution Theory of Runs: A Markov Chain Approach
- Counts of Failure Strings in Certain Bernoulli Sequences
- Success run statistics defined on an urn model
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Length of the minimum sequence containing repeats of success runs
