Shortest and longest length of success runs in binary sequences
From MaRDI portal
Publication:2455709
DOI10.1016/j.jspi.2006.07.007zbMath1128.60009OpenAlexW2090295720WikidataQ56010508 ScholiaQ56010508MaRDI QIDQ2455709
Andreas N. Philippou, Zaharias M. Psillakis, Frosso S. Makri
Publication date: 26 October 2007
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2006.07.007
Bernoulli trialssuccess runslinear and circular binary sequencesPolya-Eggenberger sampling schemereliability of consecutive systems
Related Items (24)
The \(m\)th longest runs of multivariate random sequences ⋮ On discrete Gibbs measure approximation to runs ⋮ The Hausdorff dimension of level sets described by Erdős-Rényi average ⋮ Markov binomial distribution of order \(k\) and its applications ⋮ Computing waiting time probabilities related to \((k_1, k_2, \dots, k_l)\) pattern ⋮ Generalizations of distributions related to \((k_1,k_2)\)-runs ⋮ Discrete time shock models involving runs ⋮ Minimum and maximum distances between failures in binary sequences ⋮ Exact and asymptotic results for pattern waiting times ⋮ On runs of length exceeding a threshold: normal approximation ⋮ Run statistics in a sequence of arbitrarily dependent binary trials ⋮ Distribution of runs in a sequence of exchangeable multi-state trials ⋮ Distributions related to \((k_{1},k_{2})\) events ⋮ Distribution of run statistics in partially exchangeable processes ⋮ On success runs of length exceeded a threshold ⋮ On the distribution of runs of ones in binary strings ⋮ A test statistic for weighted runs ⋮ Success run statistics defined on an urn model ⋮ The reliability of a generalized consecutive system ⋮ Pseudo-binomial approximation to \((k_1, k_2)\)-runs ⋮ A generalization of the Erdős-Rényi limit theorem and the corresponding multifractal analysis ⋮ Mean success run length ⋮ Discrete Scan Statistics Generated by Exchangeable Binary Trials ⋮ Run Statistics Defined on the Multicolor URN Model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple expressions for success run distributions in Bernoulli trials
- On the length of the longest run in a multi-state Markov chain.
- Generalized Polya-Eggenberger model of order \(k\) via lattice path approach
- On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials
- Restricted Occupancy Theory-A Generalization of Pascal's Triangle
- Polya, Inverse Polya, and Circular Polya Distributions of Orderkforl-Overlapping Success Runs
- Distribution Theory of Runs: A Markov Chain Approach
- On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding
- Lengths of runs and waiting time distributions by using Pólya-Eggenberger sampling scheme
- On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials
- Runs on a circle
- Longest run of consecutive observations having a specified attribute
- Successes, runs and longest runs
This page was built for publication: Shortest and longest length of success runs in binary sequences
