Shortest and longest length of success runs in binary sequences
From MaRDI portal
Publication:2455709
DOI10.1016/j.jspi.2006.07.007zbMath1128.60009WikidataQ56010508 ScholiaQ56010508MaRDI QIDQ2455709
Frosso S. Makri, Zaharias M. Psillakis, Andreas N. Philippou
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 trials; success runs; linear and circular binary sequences; Polya-Eggenberger sampling scheme; reliability of consecutive systems
Related Items
Success run statistics defined on an urn model, Run Statistics Defined on the Multicolor URN Model, Distribution of runs in a sequence of exchangeable multi-state trials, Distributions related to \((k_{1},k_{2})\) events
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
