On the mean and extreme distances between failures in Markovian binary sequences
DOI10.1016/j.cam.2011.09.013zbMath1230.60078OpenAlexW2057730737MaRDI QIDQ654768
Femin Yalcin, Serkan N. Eryılmaz
Publication date: 21 December 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.09.013
Probability distributions: general theory (60E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Run statistics in a sequence of arbitrarily dependent binary trials
- On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results
- Minimum and maximum distances between failures in binary sequences
- On the distribution of runs of ones in binary strings
- Formulae and recursions for the joint distributions of success runs of several lengths in a two-state Markov chain
- On run statistics for binary trials
- Success runs of length \(k\) in Markov dependent trials
- Mean success run length
- Runs in superpositions of renewal processes with applications to discrimination
- Discrete Scan Statistics Generated by Exchangeable Binary Trials
- Success run statistics defined on an urn model
This page was built for publication: On the mean and extreme distances between failures in Markovian binary sequences
