On the Mean and Extreme Distances Between Failures in Markovian Binary Sequences
Loading...
Files
Date
2011
Authors
Eryılmaz, Serkan
Yalcin, Femin
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Science Bv
Open Access Color
HYBRID
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Top 10%
Influence
Top 10%
Popularity
Average
Abstract
This paper is concerned with the mean, minimum and maximum distances between two successive failures in a binary sequence consisting of Markov dependent elements. These random variables are potentially useful for the analysis of the frequency of critical events occurring in certain stochastic processes. Exact distributions of these random variables are derived via combinatorial techniques and illustrative numerical results are presented. (C) 2011 Elsevier B.V. All rights reserved.
Description
Keywords
Binary sequence, Exact distribution, Extremes, Markov chain, System reliability, Run Statistics, Success Runs, Trials, Length, Computational Mathematics, System reliability, Binary sequence, Applied Mathematics, Extremes, Markov chain, Exact distribution, Combinatorial probability, extremes, Markov chains (discrete-time Markov processes on discrete state spaces), system reliability, Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.), binary sequence, Probability distributions: general theory, exact distribution
Fields of Science
0101 mathematics, 01 natural sciences
Citation
WoS Q
Q1
Scopus Q
Q1
OpenCitations Citation Count
9
Source
Journal of Computatıonal And Applıed Mathematıcs
Volume
236
Issue
6
Start Page
1502
End Page
1510
PlumX Metrics
Citations
CrossRef : 5
Scopus : 6
Captures
Mendeley Readers : 3
SCOPUS™ Citations
6
checked on Mar 16, 2026
Web of Science™ Citations
5
checked on Mar 16, 2026
Google Scholar™
