Exact Distributional Results for Random Resistance Trees

With a view to the study of, for instance, arterial trees, this paper presents some exact distributional results on finite trees with (reciprocal) inverse Gaussian and gamma resistances. In particular, it is shown that under the specified model the conditional distribution of the minimal sufficient statistic given the total resistance of the tree is a convolution of gamma distributions and two-dimensional reciprocal inverse Gaussian distributions.     

Run rules based phase II c and np charts when process parameters are unknown

Abstract

The performance of attributes control charts is usually evaluated under the assumption of known process parameters (i.e., the nominal proportion of non conforming units or the nominal average number of nonconformities). However, in practice, these process parameters are rarely known and have to be estimated from an in-control Phase I data set. The major contributions of this paper are (a) the derivation of the run length properties of the Run Rules Phase II c and np charts with estimated parameters, particularly focusing on the ARL, SDRL, and 0.05, 0.5, and 0.95 quantiles of the run length distribution; (b) the investigation of the number m of Phase I samples that is needed by these charts in order to obtain similar in-control ARLs to the known parameters case; and (c) the proposition of new specific chart parameters that allow these charts to have approximately the same in-control ARLs as the ones obtained in the known parameters case.     

The computation of average run length and average time to signal: an overview

Control charts are widely used in industries to monitor a process for quality improvement. Evaluation of the average run length (ARL) or average time to signal (ATS) plays an important role in the design of control charts and performance comparison. In this paper, we review several basic and popular procedures, including the Markov chain and integral equation methods for computing ARL, ATS and associated run length distributions for cumulative sum charts, exponentially weighted moving average charts and combined control charts, respectively. Some important references and key formulations are provided for practitioners.     

On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials

The number of success runs for nonhomogeneous markov dependent trials are represented as the sum of Bernoulli trials and the expected value of runs are obtained by using this representation. The distribution and bounds for the distribution of the longest run are derived for markov dependent trials.     

Quotas on runs of successes and failures in a multi-state markov chain

For the time-homogeneous multi-state Markov chain {X_n,n≧0} with states labeled as "0" (success) and "f"(failure), f=1,2,… the waiting time problems to be discussed arise by setting quotas on runs of success and failures. Some particular cases are considered.     

ARL-Design of S Charts with k-of-k Runs Rules

The standard S chart signals an out-of-control condition when one point exceeds a control limit. It can be augmented with runs rules to improve its performance in detecting assignable causes. A commonly used rule signals when k consecutive points exceed a control limit. This rule can be used alone or to supplement the standard chart. In this article we derive ARL expressions for charts with the k-of-k runs rule. We show how to design S charts with this runs rule, compare their ARL performance, and make a control chart recommendation when it is important to monitor for both increases and decreases in process dispersion.     

Some Results for Uniformizable Semi-Markov Processes

It is well known that finite Markov chains (M.C.s) in continuous time are uniformizable. That is, a finite M. C. in continuous time can be treated as an M. C. in discrete time with random Poisson transition epochs. In this paper, we see to what extent generalization of the uniformization to a class of semi-Markov Processes (S.M.P.s) is possible. A necessary condition under which S.M.P.s are uniformizable is provided. It is shown that, an S.M.P. with dwell-time distributions depending only on the current state is uniformizable if and only if the distributions are compound geometric distributions having the same base distribution. It is also shown that if the distributions are of generalized phase type then an S.M.P. being uniformizable implies that it is an M.C. in continuous time. Some properties that are shared by a uniformizable S.M.P. and the associated M.C. in discrete time are also discussed.     

Efficient sequential estimation for compound poisson processes

This paper discusses uniformly minimum variance, unbiased sequential estimation of a real-valued parametric function for a compound Poisson process when the compounding random variables belong to the exponential family. The characterization of Cramer-Rao efficient plans by Stefanov (1982 b) is shown to be incomplete by obtaining a new efficient plan for the compound Poisson-Bernoulli process. This new plan completes the characterization of Cramer-Rao efficient plans. The class of Bhattacharyya efficient estimators of order two is determined for all the efficient sampling schemes.     

The Steady-State Performance of Cumulative Count of a Conforming Control Chart Based On Runs Rules

Cumulative count of conforming control chart is usually used to monitor fraction nonconforming in high-yield processes. In this article, we propose m-of-m control chart based on cumulative count of conforming units for high-yield processes. The steady-state properties of the m-of-m control chart are investigated. We compare performance of the m-of-m control chart with control chart based on cumulative count of conforming units. We present Markov chain model of the m-of-m control chart to evaluate average run length, standard deviation of run length and quartiles.     

The Run Sum R Chart with Fast Initial Response

A fast initial response (FIR) feature for the run sum R chart is proposed and its ARL performance estimated by a Markov chain representation. It is shown that this chart is more sensitive than several R charts with runs rules proposed by different authors. We conclude that the run sum R chart is simple to use and a very effective tool for monitoring increases and decreases in process dispersion.     

Monitoring exponential data using two-sided control charts with runs rules

In this article, new two-sided control charts with runs rules, suitable for the monitoring of exponential data, are proposed and studied. The proposed schemes are suitable to identify changes (upward or downward) in the mean of an exponential distribution. Also, they have the desired in-control performance as well as unbiased performance. Guidelines for the most effective scheme in practice are provided, along with comparisons with other competitive schemes. Finally, the practical application of the proposed schemes is also discussed.     

An adaptive exponentially weighted moving average control chart for monitoring process variances

The exponentially weighted moving average (EWMA) control chart is efficient in detecting small changes in process parameters but less efficient when the changes are relatively large, due to what is known as the inertia problem. To diminish the inertia, an adaptive EWMA (AEWMA) chart has been proposed for monitoring process locations to improve over the traditional EWMA charts. The basic idea of the AEWMA scheme is to dynamically weight the past observations according to a suitable function of the current prediction error. This article extends the idea of the AEWMA chart for monitoring process locations to the case of monitoring process dispersion. A Markov chain model is established to analyze and design the suggested chart. It is shown that the AEWMA dispersion chart performs better than the EWMA and other dispersion charts in terms of its ability to perform relatively well at both small and large changes in process dispersion.     

Markov bridges and enlarged filtrations

The semimartingale decomposition of a Markov chain, whose value at some future time is known, is obtained by considering an enlarged filtration.     

Flexible Latent‐State Modelling of Old Faithful's Eruption Inter‐Arrival Times in 2009

This paper is concerned with the analysis of a time series comprising the eruption inter‐arrival times of the Old Faithful geyser in 2009. The series is much longer than other well‐documented ones and thus gives a more comprehensive insight into the dynamics of the geyser. Basic hidden Markov models with gamma state‐dependent distributions and several extensions are implemented. In order to better capture the stochastic dynamics exhibited by Old Faithful, the different non‐standard models under consideration seek to increase the flexibility of the basic models in various ways: (i) by allowing non‐geometric distributions for the times spent in the different states; (ii) by increasing the memory of the underlying Markov chain, with or without assuming additional structure implied by mixture transition distribution models; and (iii) by incorporating feedback from the observation process on the latent process. In each case it is shown how the likelihood can be formulated as a matrix product which can be conveniently maximized numerically.     

Parallel discretization of the Markov chain approximation for the autoregressive moving average chart

Abstract

In the Markov chain model of an autoregressive moving average chart, the post-transition states of nonzero transition probabilities are distributed along one-dimensional lines of a constant gradient over the state space. By considering this characteristic, we propose discretizing the state space parallel to the gradient of these one-dimensional lines. We demonstrate that our method substantially reduces the computational cost of the Markov chain approximation for the average run length in two- and three-dimensional state spaces. Also, we investigate the effect of these one-dimensional lines on the computational cost. Lastly, we generalize our method to state spaces larger than three dimensions.     

The Design of the Multivariate Synthetic Exponentially Weighted Moving Average Control Chart

A multivariate synthetic exponentially weighted moving average (MSEWMA) control chart is presented in this study. The MSEWMA control chart consists of a multivariate exponentially weighted moving average (MEWMA) control chart and a conforming run length control chart. The average run length of the MSEWMA control chart is obtained using a Markov chain approach. From the numerical comparisons, it is shown that the MSEWMA control chart is more efficient than the multivariate synthetic T ² control chart and the MEWMA control chart for detecting shifts in the process mean vector.     

Optimal Statistical Design of a Multivariate EWMA Chart Based on ARL and MRL

Statistical design is applied to a multivariate exponentially weighted moving average (MEWMA) control chart. The chart parameters are control limit H and smoothing constant r. The choices of the parameters depend on the number of variables p and the size of the process mean shift δ. The MEWMA statistic is modeled as a Markov chain and the Markov chain approach is used to determine the properties of the chart. Although average run length has become a traditional measure of the performance of control schemes, some authors have suggested other measures, such as median and other percentiles of the run length distribution to explain run length properties of a control scheme. This will allow a thorough study of the performance of the control scheme. Consequently, conclusions based on these measures would provide a better and comprehensive understanding of a scheme. In this article, we present the performance of the MEWMA control chart as measured by the average run length and median run length. Graphs are given so that the chart parameters of an optimal MEWMA chart can be determined easily.