Waiting Time for an Almost Perfect Run and Applications in Statistical Process Control

Sotiris Bersimis (), Markos V. Koutras () and George K. Papadopoulos ()
Additional contact information
Sotiris Bersimis: University of Pireaus
Markos V. Koutras: University of Pireaus
George K. Papadopoulos: Agricultural University of Athens

Methodology and Computing in Applied Probability, 2014, vol. 16, issue 1, 207-222

Abstract: Abstract A natural and intuitively appealing generalization of the runs principle arises if instead of looking at fixed-length strings with all their positions occupied by successes, we allow the appearance of a small number of failures. Therefore, the focus is on clusters of consecutive trials which contain large proportion of successes. Such a formation is traditionally called “scan” or alternatively, due to the high concentration of successes within it, almost perfect (success) run. In the present paper, we study in detail the waiting time distribution for random variables related to the first occurrence of an almost perfect run in a sequence of Bernoulli trials. Using an appropriate Markov chain embedding approach we present an efficient recursive scheme that permits the construction of the associated transition probability matrix in an algorithmically efficient way. It is worth mentioning that, the suggested methodology, is applicable not only in the case of almost perfect runs, but can tackle the general discrete scan case as well. Two interesting applications in statistical process control are also discussed.

Keywords: Almost perfect run; Scans; Runs; Markov chain embeddable random variables; Runs rules; Average run length; Statistical process control; 60E05 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s11009-012-9307-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:16:y:2014:i:1:d:10.1007_s11009-012-9307-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-012-9307-6

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().