On the mean and extreme distances between failures in Markovian binary sequences

DOI10.1016/J.CAM.2011.09.013MaRDI QIDQ654768zbMATH OpenOpenAlexFDO

Authors Serkan Eryilmaz, Femin Yalcin

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

zbMATH Keywords

Markov chainsystem reliabilityextremesbinary sequenceexact distribution

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Recommendations

• Minimum and maximum distances between failures in binary sequences
• Exact distributions of constrained \((k, \ell )\) strings of failures between subsequent successes
• Mean success run length
• Elementary methods for failure due to a sequence of Markovian events
• Waiting time distributions of patterns of two failures separated by success runs of length \(k\) in Markov dependent trials

Cites work

• Discrete scan statistics generated by exchangeable binary trials
• Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
• Formulae and recursions for the joint distributions of success runs of several lengths in a two-state Markov chain
• Mean success run length
• Minimum and maximum distances between failures in binary sequences
• On run statistics for binary trials
• On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results
• On the distribution of runs of ones in binary strings
• Run statistics in a sequence of arbitrarily dependent binary trials
• Runs and scans with applications
• Runs in superpositions of renewal processes with applications to discrimination
• Success run statistics defined on an urn model
• Success runs of length \(k\) in Markov dependent trials

Cited in

(5)

• Minimum and maximum distances between failures in binary sequences
• On \(\ell\)-overlapping runs of ones of length \(k\) in sequences of independent binary random variables
• Exact distributions of constrained \((k, \ell )\) strings of failures between subsequent successes
• \(g\)-geometric and \(g\)-binomial distributions of order image
• On some general survival models with delayed failures

This page was built for publication: On the mean and extreme distances between failures in Markovian binary sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654768)