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.
Similar content being viewed by others
References
Aparisi F, Champ CW, Garcia Diaz JC (2004) A performance analysis of Hotelling’s χ 2 control chart with supplementary run rules. Qual Eng 16:359–368
Balakrishnan N, Koutras MV (2002) Runs and scans with applications. Wiley, New York
Balakrishnan N, Koutras MV and Bersimis S (2009) Run and frequency quota rules in process monitoring and acceptance sampling. J Qual Technol 41:66–81
Bersimis S, Psarakis S, Panaretos J (2007) Multivariate statistical process control charts: an overview. Qual Reliab Eng Int 23:517–543
Bersimis B, Koutras M V, Papadopoulos G K (2008) Waiting time for an almost perfect run. In: Proceedings of IWAP2008. Compiegne, France
Chang CJ, Fann CSJ, Chou WC, Lian IB (2003) On the tail probability of the longest well-matching run. Stat Prob Lett 63:267–274
Fu JC (2001) Distribution of the scan statistic for a sequence of Bistate trials. J Appl Prob 38:908–916
Fu JC, Chang YM (2001) On probability generating functions for waiting time distributions of compound patterns in a sequence of multi-state trials. Technical Report, Department of Statistics, University of Manitoba, Canada
Fu JC, Koutras MV (1994) Distribution theory of runs: a Markov chain approach. J Am Stat Assoc 89:1050–1058
Fu JC, Lou WYW (2003) Distribution theory of runs and patterns and its applications. World Scientific, New Jersey
Glaz J, Naus J, Wallenstein S (2001) Scan statistics. In: Springer series in statistics. Springer, Berlin Heidelberg New York
Han Q, Hirano K (2003) Waiting time problem for an almost perfect match. Stat Prob Lett 65:39–49
Khoo MBC, Quah SH (2003) Incorporating runs rules into Hotelling’s χ 2 control charts. Qual Eng 15:671–675
Koutras MV, Milienos FS (2012) Exact and asymptotic results for pattern waiting times. J Stat Plann Infer 142:1464–1479
Koutras MV, Bersimis S, Antzoulakos DL (2006) Improving the performance of the Chi-square control chart via runs rules. Meth Comput Appl Probab 8:409–426
Koutras MV, Bersimis S, Maravelakis PE (2007) Statistical process control using Shewhart control charts with supplementary runs rules. Meth Comput Appl Prob 9:207–224
Rakitzis AC, Antzoulakos DL (2011) Chi-square control charts with runs rules. Meth Comput Appl Probab 13:657–669
Shmueli G (2002) System-wide probabilities for systems with runs and scans rules. Meth Comput Appl Probab 4:409–419
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bersimis, S., Koutras, M.V. & Papadopoulos, G.K. Waiting Time for an Almost Perfect Run and Applications in Statistical Process Control. Methodol Comput Appl Probab 16, 207–222 (2014). https://doi.org/10.1007/s11009-012-9307-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-012-9307-6
Keywords
- Almost perfect run
- Scans
- Runs
- Markov chain embeddable random variables
- Runs rules
- Average run length
- Statistical process control