On residual lifetimes in sequential (n ? k?+?1)-out-of-n systems

Sequential order statistics is an extension of ordinary order statistics. They model the successive failure times in sequential k-out-of-n systems, where the failures of components possibly affect the residual lifetimes of the remaining ones. In this paper, we consider the residual lifetime of the components after the kth failure in the sequential (n − k + 1)-out-of-n system. We extend some results on the joint distribution of the residual lifetimes of the remaining components in an ordinary (n − k + 1)-out-of-n system presented in Bairamov and Arnold (Stat Probab Lett 78(8):945–952, 2008) to the case of the sequential (n − k + 1)-out-of-n system.     

Characterizations based on regression assumptions of order statistics

Let X₍₁₎≤X₍₂₎≤···≤X_(n) be the order statistics from independent and identically distributed random variables {X_i, 1≤i≤n} with a common absolutely continuous distribution function. In this work, first a new characterization of distributions based on order statistics is presented. Next, we review some conditional expectation properties of order statistics, which can be used to establish some equivalent forms for conditional expectations for sum of random variables based on order statistics. Using these equivalent forms, some known results can be extended immediately.     

Structure-preserving mappings of uniform order statistics

There are several well-known mappings which transform the first r common order statistics in a sample of size n from a standard uniform distribution to a full vector of dimension r of order statistics in a sample of size r from a uniform distribution. Continuing the results reported in a previous paper by the authors, it is shown that transformations of these types do not lead to order statistics from an i.i.d. sample of random variables, in general, when being applied to order statistics from non-uniform distributions. By accepting the loss of one dimension, a structure-preserving transformation exists for power function distributions.     

Shortest and longest length of success runs in binary sequences

The shortest and the longest length of success runs statistics in binary sequences are considered. The sequences are arranged on a line or on a circle. Exact probabilities of these statistics are derived, both in closed formulae via combinatorial analysis, as well as recursively. Furthermore, their joint probability distribution function and cumulative distribution function are obtained. The results are developed first for Bernoulli trials (i.i.d. binary sequences), and then they are generalized to the Polya–Eggenberger sampling scheme. For the latter case, the length of the longest success run is related to other success runs statistics and to reliability of consecutive systems.     

On binomial and circular binomial distributions of orderk forl-overlapping success runs of lengthk

The number ofl-overlapping success runs of lengthk inn trials, which was introduced and studied recently, is presently reconsidered in the Bernoulli case and two exact formulas are derived for its probability distribution function in terms of multinomial and binomial coefficients respectively. A recurrence relation concerning this distribution, as well as its mean, is also obtained. Furthermore, the number ofl-overlapping success runs of lengthk inn Bernoulli trials arranged on a circle is presently considered for the first time and its probability distribution function and mean are derived. Finally, the latter distribution is related to the first, two open problems regarding limiting distributions are stated, and numerical illustrations are given in two tables. All results are new and they unify and extend several results of various authors on binomial and circular binomial distributions of orderk.     

On the asymptotic independence of numbers of observations near order statistics

In this paper, we consider the numbers of observations in two-sided neighbourhoods of the kth and (n?r)th order statistics from a sample of size n and show that they are asymptotically independent as n→∞. We also establish a result that generalizes all the existing results regarding the asymptotic independence of numbers of observations in the left and right neighbourhoods of order statistics. Finally, we consider the limiting joint behaviour of numbers of observations in the neighbourhoods of s central order statistics and establish that they are asymptotically independent.     

Tests for high-dimensional covariance matrices using the theory of U-statistics

Test statistics for sphericity and identity of the covariance matrix are presented, when the data are multivariate normal and the dimension, p, can exceed the sample size, n. Under certain mild conditions mainly on the traces of the unknown covariance matrix, and using the asymptotic theory of U-statistics, the test statistics are shown to follow an approximate normal distribution for large p, also when p?n. The accuracy of the statistics is shown through simulation results, particularly emphasizing the case when p can be much larger than n. A real data set is used to illustrate the application of the proposed test statistics.     

Prediction Intervals for Future Order Statistics from a Generalized Modified Weibull

Viewing the future order statistics as latent variables at each Gibbs sampling iteration, several Bayesian approaches to predict future order statistics based on type-II censored order statistics, X₍₁₎, X₍₂₎, …, X_(r), of a size n( > r) random sample from a four-parameter generalized modified Weibull (GMW) distribution, are studied. Four parameters of the GMW distribution are first estimated via simulation study. Then various Bayesian approaches, which include the plug-in method, the Monte Carlo method, the Gibbs sampling scheme, and the MCMC procedure, are proposed to develop the prediction intervals of unobserved order statistics. Finally, four type-II censored samples are utilized to investigate the predictions.     

Run statistics in a sequence of arbitrarily dependent binary trials

Let {Z _i } _i≥1 be an arbitrary sequence of trials with two possible outcomes either success (1) or failure (0). General expressions for the exact distributions of runs, both success and failure, in Z ₁, . . . , Z _n are presented. Our method is based on the use of joint distribution of success and failure run lengths and unifies the results on distribution of runs. As a special case of our results we obtain the distributions of runs for various binary sequences. As illustrated in the paper the results enable us to derive the distribution of runs for binary trials arising in urn models.     

ON CHARACTERIZING DISTRIBUTIONS VIA LINEARITY OF REGRESSION FOR ORDER STATISTICS

Let X₁X_n be a random sample from an absolutely continuous distribution with the corresponding order statistics X_1:n≤X_2:n≤X_n:n. A complete solution of the problem, posed in 1967 by T. Ferguson, of determining the distribution by linearity of regression of X_k+2:n with respect to X_k:n is given. The only possible distributions are of the exponential, power and Pareto type. A linear regression relation for exponents of order statistics is also considered.     

Concomitants in a Sequence of Independent Nonidentically Distributed Random Vectors

ABSTRACT

Concomitants of order statistics are considered for the situation in which the random vectors (X ₁, Y ₁), (X ₂, Y ₂),…, (X _n , Y _n ) are independent but otherwise arbitrarily distributed. The joint and marginal distributions of the concomitants of order statistics and stochastic comparisons among the concomitants of order statistics are studied in this situation.     

Inequalities for the partial sums of elliptical order statistics related to genetic selection

Let X₁,…,X_n be exchangeable normal variables with a common correlation p, and let X₍₁₎ > … > X_(n) denote their order statistics. The random variable σⁿ_i=_n—_k+1x_i, called the selection differential by geneticists, is of particular interest in genetic selection and related areas. In this paper we give results concerning a conjecture of Tong (1982) on the distribution of this random variable as a function of ρ. The same technique used can be applied to yield more general results for linear combinations of order statistics from elliptical distributions.     

2<Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>4<Superscript>1</Superscript> designs with minimum aberration or weak minimum aberration

For measuring the goodness of 2 ^m 4¹ designs, Wu and Zhang (1993) proposed the minimum aberration (MA) criterion. MA 2 ^m 4¹ designs have been constructed using the idea of complementary designs when the number of two-level factors, m, exceeds n/2, where n is the total number of runs. In this paper, the structures of MA 2 ^m 4¹ designs are obtained when m>5n/16. Based on these structures, some methods are developed for constructing MA 2 ^m 4¹ designs for 5n/16<m<n/2 as well as for n/2≤m<n. When m≤5n/16, there is no general method for constructing MA 2 ^m 4¹ designs. In this case, we obtain lower bounds for A ₃₀ and A ₃₁, where A ₃₀ and A ₃₁ are the numbers of type 0 and type 1 words with length three respectively. And a method for constructing weak minimum aberration (WMA) 2 ^m 4¹ designs (A ₃₀ and A ₃₁ achieving the lower bounds) is demonstrated. Some MA or WMA 2 ^m 4¹ designs with 32 or 64 runs are tabulated for practical use, which supplement the tables in Wu and Zhang (1993), Zhang and Shao (2001) and Mukerjee and Wu (2001).     

On the Markov property of order statistics

The order statistics from a sample of size n≥3 from a discrete distribution form a Markov chain if and only if the parent distribution is supported by one or two points. More generally, a necessary and sufficient condition for the order statistics to form a Markov chain for (n≥3) is that there does not exist any atom x₀ of the parent distribution F satisfying F(x₀-)>0 and F(x₀)<1. To derive this result a formula for the joint distribution of order statistics is proved, which is of an interest on its own. Many exponential characterizations implicitly assume the Markov property. The corresponding putative geometric characterizations cannot then be reasonably expected to obtain. Some illustrative geometric characterizations are discussed.     

A method for constructing supersaturated designs and its Es2 optimality

A lower bound for the Es² value of an arbitrary supersaturated design is derived. A general method for constructing supersaturated designs is proposed and shown to produce designs with n runs and m = k(n — 1) factors that achieve the lower bound for Es² and are thus optimal with respect to the Es² criterion. Within the class of designs given by the construction method, further discrimination can be made by minimizing the pairwise correlations and using the generalized D and A criteria proposed by Wu (1993). Efficient designs of 12, 16, 20 and 24 runs are constructed by following this approach.     

An alternative proof of order statistics moment problem

A necessary and sufficient condition that two distributions having finite means are identical is that for any fixed integer r > 0, the expected values of their rth (n ? r) order statistics are equal [or the expected values of their (n-r)th (n > r ? 0) order statistics are equal] for all n where n is the sample size.     

A Study on EWMA charts with runs rules—the Markov chain approach

ABSTRACT

Runs rules are usually used with Shewhart-type charts to enhance the charts' sensitivities toward small and moderate shifts. Abbas et al. in 2011 took it a step further by proposing two runs rules schemes, applied to the exponentially weighted moving average (EWMA) chart and evaluated their average run length (ARL) performances using simulation. They showed that the proposed schemes are superior to the classical EWMA chart and other schemes being investigated. Besides pointing out some erroneous ARL and standard deviation of the run length (SDRL) computations in Abbas et al., this paper presents a Markov chain approach for computing the ARL, percentiles of the run length (RL) distribution and SDRL, for the two runs rules schemes of Abbas et al. Using Markov chain, we also propose two combined runs rules EWMA schemes to quicken the two schemes of Abbas et al. in responding to large shifts. The runs rules (basic and combined rules) EWMA schemes will be compared with some existing control charting methods, where the former charts are shown to prevail.     

On the E-optimality of blocked main effects plans in blocks of different sizes

In this article, we consider experimental situations in which m 2-level factors are to be studied using a main effects plan where n runs are to be partitioned into b blocks having both even and odd sizes. For these cases, we give some simple methods for constructing E-optimal designs.