On Limited Length Binary Strings with an Application in Statistical Control
F.S. Makri1, *, Z.M. Psillakis2
1 Department of Mathematics, University of Patras, 26500 Patras, Greece
2 Department of Physics, University of Patras, 26500 Patras, Greece
Abstract
In a 0 - 1 sequence of Markov dependent trials we consider a statistic which counts strings of a limited length run of 0s between subsequent 1s. Its probability mass function is used to determine the chance that a stochastic process remains or not in statistical control. Illustrative numerics are presented.
Keywords: Binary strings, runs, overlapping counting, Markov chain, Statistical control.
Article Information
Article History:
Received Date: 04/08/2016
Revision Received Date: 01/09/2016
Acceptance Date: 12/09/2016
Electronic publication date: 28/02/2017
Collection year: 2017
© 2017 Makri and Psillakis
open-access license: This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International Public License (CC-BY 4.0), a copy of which is available at:
https://creativecommons.org/licenses/by/4.0/legalcode. This license permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
* Address correspondence to this author at the Department of Mathematics, University of Patras, 26500 Patras, Greece; Tel: 0030-2610-996738; E-mail: makri@math.upatras.gr
Open Peer Review Details |
Manuscript submitted on 04-08-2016 |
Original Manuscript |
On Limited Length Binary Strings with an Application in Statistical Control |