Shortest and longest length of success runs in binary sequences
Consider a sequence of \(n\) two state (success-failure) trials, arranged on a line or on a circle. A success run is defined as a sequence of consecutive successes preceded and succeeded by failure or by the beginning or by the end of a complete sequence. The number of successes in a success run is referred to as its length. In this article the shortest and the longest length statistics of success runs that appear in binary sequences are considered. Exact probabilities of the statistics are derived by means of combinatorial analysis and via recursive relations. The joint probability distribution function and the joint cumulative distribution function of foregoing length statistics are also obtained both for the linear and the circular case, in terms of binomial coefficients. [Related papers: \textit{J. C. Fu, L. I. Wang} and \textit{W. Y. W. Lou}, J. Appl. Probab. 40, 346--360 (2003; Zbl 1028.60068); \textit{E. Vaggelatou}, Stat. Probab. Lett. 62, 211--221 (2003; Zbl 1116.60344).]
- Length of the minimum sequence containing repeats of success runs
- scientific article; zbMATH DE number 140097
- Minimum and maximum distances between failures in binary sequences
- Binary strings of length n with x zeros and longest k-runs of zeros
- scientific article; zbMATH DE number 3919443
- On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence
- The maximum run length in the generalized Bernoulli sequences
- On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results
- On the distribution of runs of ones in binary strings
- Distribution Theory of Runs: A Markov Chain Approach
- Generalized Polya-Eggenberger model of order \(k\) via lattice path approach
- scientific article; zbMATH DE number 4161775 (Why is no real title available?)
- scientific article; zbMATH DE number 3919443 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 1222509 (Why is no real title available?)
- scientific article; zbMATH DE number 806863 (Why is no real title available?)
- Lengths of runs and waiting time distributions by using Pólya-Eggenberger sampling scheme
- Longest run of consecutive observations having a specified attribute
- On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials
- On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding
- On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials
- On the length of the longest run in a multi-state Markov chain.
- Polya, Inverse Polya, and Circular Polya Distributions of Orderkforl-Overlapping Success Runs
- Restricted Occupancy Theory-A Generalization of Pascal's Triangle
- Runs and scans with applications
- Runs on a circle
- Simple expressions for success run distributions in Bernoulli trials
- Successes, runs and longest runs
- The Hausdorff dimension of level sets described by Erdős-Rényi average
- Markov binomial distribution of order k and its applications
- A generalization of the Erdős-Rényi limit theorem and the corresponding multifractal analysis
- A test statistic for weighted runs
- The reliability of a generalized consecutive system
- Length of the minimum sequence containing repeats of success runs
- The \(m\)th longest runs of multivariate random sequences
- Generalizations of distributions related to \((k_1,k_2)\)-runs
- Mean success run length
- Discrete scan statistics generated by exchangeable binary trials
- Exact and asymptotic results for pattern waiting times
- Run statistics in a sequence of arbitrarily dependent binary trials
- On discrete Gibbs measure approximation to runs
- Distribution of run statistics in partially exchangeable processes
- On success runs of length exceeded a threshold
- Success run statistics defined on an urn model
- Run Statistics Defined on the Multicolor URN Model
- Successes, runs and longest runs
- Computing waiting time probabilities related to \((k_1, k_2, \dots, k_l)\) pattern
- Minimum and maximum distances between failures in binary sequences
- On runs of length exceeding a threshold: normal approximation
- On the longest run and the waiting time for the first run in a continuous time multi-state Markov chain
- Pseudo-binomial approximation to \((k_1, k_2)\)-runs
- Joint distributions of numbers of success runs of specified lengths in linear and circular se\-quences
- Discrete time shock models involving runs
- Distribution of runs in a sequence of exchangeable multi-state trials
- Distributions related to \((k_{1},k_{2})\) events
- On the distribution of runs of ones in binary strings
This page was built for publication: Shortest and longest length of success runs in binary sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2455709)
