On bootstrapping the number of components in finite mixtures of Poisson distributions

Finite mixture models arise in a natural way in that they are modeling unobserved population heterogeneity. It is assumed that the population consists of an unknown number k of subpopulations with parameters λ₁, ..., λ_k receiving weights p₁, ..., p_k. Because of the irregularity of the parameter space, the log-likelihood-ratio statistic (LRS) does not have a (χ²) limit distribution and therefore it is difficult to use the LRS to test for the number of components. These problems are circumvented by using the nonparametric bootstrap such that the mixture algorithm is applied B times to bootstrap samples obtained from the original sample with replacement. The number of components k is obtained as the mode of the bootstrap distribution of k. This approach is presented using the Times newspaper data and investigated in a simulation study for mixtures of Poisson data.     

Number of Working Components in Consecutive k-out-of-n System While It Is Working

In this article we study the distribution and expected value of the number of working components at time t in a consecutive k-out-of-n system under the condition that it is working at time t. We provide the exact distribution of the corresponding conditional random variable and compute its expected value for the system consisting of exchangeable dependent components. The results are also extended to any coherent system by the aid of system signature. Finally, we present illustrative and computational results for some systems having Lomax components.     

Replacement policies for age and working numbers with random life cycle

It has been modeled for several replacement policies in literatures that the whole life cycle or operating interval of an operating unit should be finite rather than infinite as is done with the traditional method. However, it is more natural to consider the case in which the finite life cycle is a fluctuated parameter that could be used to estimate replacement times, which will be taken up in this article. For this, we first formulate a general model in which the unit is replaced at random age U, random time Y for the first working number, random life cycle S, or at failure X, whichever occurs first. The following models included in the general model, such that replacement done at age T when variable U is a degenerate distribution, and replacement done at working numbers N summed by number N of variable Y, are optimized. We obtain the total expected cost until replacement and the expected replacement cost rate for each model. Optimal age T, working number N, and a pair of (T, N) are discussed analytically and computed numerically.     

Optimization of continuous and discrete scheduled times for a cumulative damage system with age-dependent maintenance

Abstract

This paper presents a preventive replacement problem when a system is operating successive works with random times and suffering stochastic shocks. The works cause random amount additive damage to the system, and the system fails whenever the cumulative damage reaches a failure level threshold. As an external shock occurs, the system experiences one of the two types of shocks with age-dependent maintenance mechanism: type-I (minor) shock is rectified by a minimal repair, or type-II (catastrophic) shock causes the system to fail. To control the deterioration process, preventive replacement is scheduled to replace the system at a continuous age T or at a discrete number N of working cycles, whichever occurs first, and corrective replacement is performed immediately whenever the system fails due to either shock or damage. The optimal preventive replacement schedule that minimizes the expected cost rate is discussed analytically and computed numerically. The proposed model provides a general framework for analyzing maintenance policies and extends several existing results.     

A sampling plan for one-shot systems considering destructive inspection

Abstract

The paper is concerned with an acceptance sampling problem under destructive inspections for one-shot systems. The systems may fail at random times while they are operating (as the systems are considered to be operating when storage begins), and these failures can only be identified by inspection. Thus, n samples are randomly selected from N one-shot systems for periodic destructive inspection. After storage time T, the N systems are replaced if the number of working systems is less than a pre-specified threshold k. The primary purpose of this study is to determine the optimal number of samples n*, extracted from the N for destructive detection and the optimal acceptance number k*, in the sample under the constraint of the system interval availability, to minimize the expected cost rate. Numerical experiments are studied to investigate the effect of the parameters in sampling inspection on the optimal solutions.     

Some Properties of Order Statistics When the Sample Size Is Random

ABSTRACT

The study of r-out-of-n systems is of utmost importance in reliability theory. In this note, we study closure of different partial orders under the formation of r-out-of-N and (N ? s)-out-of-N systems when the number of components N, forming the system, is a random variable having support {k, k + 1,…}, where k is a fixed positive integer, r ∈ {1,…, k} and s ∈ {0, 1,…, k ? 1}. This generalizes quite a few results already known in the literature. We also study the closure of different partial orders when two systems are formed out of different random number of components.     

Moments of suprema of random variables

The supremum of random variables representing a sequence of rewards is of interest in establishing the existence of optimal stopping rules. Necessary and sufficient conditions are given for existence of moments of sup_n(X_n ? c_n) and sup_n(S_n ? c_n) where X₁, X₂, … are i.i.d. random variables, S_n = X₁ + … + X_n, and c_n = (nL(n))^1/r, 0 < r < 2, L = 1, L = log, and L = log log. Following Cohn (1974), “rates of convergence” results are used in the proof.     

Optimal One-Way Random Effects Designs for the Intraclass Correlation Based on Confidence Intervals

ABSTRACT

Confidence intervals for the intraclass correlation coefficient (ρ) are used to determine the optimal allocation of experimental material in one-way random effects models. Designs that produce narrow intervals are preferred since they provide greater precision to estimate ρ. Assuming the total cost and the relative cost of the two stages of sampling are fixed, the authors investigate the number of classes and the number of individuals per class required to minimize the expected length of confidence intervals. We obtain results using asymptotic theory and compare these results to those obtained using exact calculations. The best design depends on the unknown value of ρ. Minimizing the maximum expected length of confidence intervals guards against worst-case scenarios. A good overall recommendation based on asymptotic results is to choose a design having classes of size 2 + √4 + 3r, where r is the relative cost of sampling at the class-level compared to the individual-level. If r = 0, then the overall cost is the sample size and the recommendation reduces to a design having classes of size 4.     

Convergence properties for weighted sums of NSD random variables

Abstract

Let {X_n, n ? 1} be a sequence of negatively superadditive dependent (NSD, in short) random variables and {b_ni, 1 ? i ? n, n ? 1} be an array of real numbers. In this article, we study the strong law of large numbers for the weighted sums ∑ⁿ_{i = 1}b_niX_i without identical distribution. We present some sufficient conditions to prove the strong law of large numbers. As an application, the Marcinkiewicz-Zygmund strong law of large numbers for NSD random variables is obtained. In addition, the complete convergence for the weighted sums of NSD random variables is established. Our results generalize and improve some corresponding ones for independent random variables and negatively associated random variables.     

Orthogonal polynomials generated by random vectors

Every random q-vector with finite moments generates a set of orthonormal polynomials. These are generated from the basis functions xn = xn11…xnqq using Gram–Schmidt orthogonalization. One can cycle through these basis functions using any number of ways. Here, we give results using minimum cycling. The polynomials look simpler when centered about the mean of X, and still simpler form when X is symmetric about zero. This leads to an extension of the multivariate Hermite polynomial for a general random vector symmetric about zero. As an example, the results are applied to the multivariate normal distribution.     

Three-term asymptotic expansion: A semi-Markovian random walk with a generalized beta distributed interference of chance

A semi-Markovian random walk process (X(t)) with a generalized beta distribution of chance is considered. The asymptotic expansions for the first four moments of the ergodic distribution of the process are obtained as E(ζ_n) → ∞ when the random variable ζ_n has a generalized beta distribution with parameters (s, S, α, β); ?α, β > 1,?0? ? s < S < ∞. Finally, the accuracy of the asymptotic expansions is examined by using the Monte Carlo simulation method.     

Optimal preventive policies for imperfect maintenance models with replacement first and last

ABSTRACT

This paper proposes preventive replacement policies for an operating system which may continuously works for N jobs with random working times and is imperfectly maintained upon failure. As a failure occurs, the system suffers one of the two types of failures based on some random mechanism: type-I (repairable or minor) failure is rectified by a minimal repair, or type-II (non repairable or catastrophic) failure is removed by a corrective replacement. A notation of preventive replacement last model is considered in which the system is replaced before any type-II failure at an operating time T or at number N of working times, whichever occurs last. Comparisons between such a preventive replacement last and the conventional replacement first are discussed in detail. For each model, the optimal schedule of preventive replacement that minimizes the mean cost rate is presented theoretically and determined numerically. Because the framework and analysis are general, the proposed models extend several existing results.     

A class of regression models for parallel and series systems with a random number of components

We extend the Weibull power series (WPS) class of distributions to the new class of extended Weibull power series (EWPS) class of distributions. The EWPS distributions are related to series and parallel systems with a random number of components, whereas the WPS distributions [Morais AL, Barreto-Souza W. A compound class of Weibull and power series distributions. Computational Statistics and Data Analysis. 2011;55:1410–1425] are related to series systems only. Unlike the WPS distributions, for which the Weibull is a limiting special case, the Weibull law is a particular case of the EWPS distributions. We prove that the distributions in this class are identifiable under a simple assumption. We also prove stochastic and hazard rate order results and highlight that the shapes of the EWPS distributions are markedly more flexible than the shapes of the WPS distributions. We define a regression model for the EWPS response random variable to model a scale parameter and its quantiles. We present the maximum likelihood estimator and prove its consistency and asymptotic normal distribution. Although series and parallel systems motivated the construction of this class, the EWPS distributions are suitable for modelling a wide range of positive data sets. To illustrate potential uses of this model, we apply it to a real data set on the tensile strength of coconut fibres and present a simple device for diagnostic purposes.     

Empirical Bayes testing for guarantee lifetime: Non identical components case

This article considers an empirical Bayes testing problem for the guarantee lifetime in the two-parameter exponential distributions with non identical components. We study a method of constructing empirical Bayes tests under a class of unknown prior distributions for the sequence of the component testing problems. The asymptotic optimality of the sequence of empirical Bayes tests is studied. Under certain regularity conditions on the prior distributions, it is shown that the sequence of the constructed empirical Bayes tests is asymptotically optimal, and the associated sequence of regrets converges to zero at a rate O(n^{? 1 + 1/[2(r + α) + 1]}) for some integer r ? 0 and 0 ? α ? 1 depending on the unknown prior distributions, where n is the number of past data available when the (n + 1)st component testing problem is considered.     

Generalized likelihood-ratio test of the number of components in finite mixture models

The number of components is an important feature in finite mixture models. Because of the irregularity of the parameter space, the log-likelihood-ratio statistic does not have a chi-square limit distribution. It is very difficult to find a test with a specified significance level, and this is especially true for testing k — 1 versus k components. Most of the existing work has concentrated on finding a comparable approximation to the limit distribution of the log-likelihood-ratio statistic. In this paper, we use a statistic similar to the usual log likelihood ratio, but its null distribution is asymptotically normal. A simulation study indicates that the method has good power at detecting extra components. We also discuss how to improve the power of the test, and some simulations are performed.     

Optimal allocation of time points for the random effects model

In this article the problem of the optimal selection and allocation of time points in repeated measures experiments is considered. D‐ optimal designs for linear regression models with a random intercept and first order auto‐regressive serial correlations are computed numerically and compared with designs having equally spaced time points. When the order of the polynomial is known and the serial correlations are not too small, the comparison shows that for any fixed number of repeated measures, a design with equally spaced time points is almost as efficient as the D‐ optimal design. When, however, there is no prior knowledge about the order of the underlying polynomial, the best choice in terms of efficiency is a D‐ optimal design for the highest possible relevant order of the polynomial. A design with equally‐spaced time points is the second best choice     

ON A SHARED ALLELE TEST OF RANDOM MATING

A simple random sample is observed from a population with a large number‘K’ of alleles, to test for random mating. Of n couples, n_ijkl have female genotype ij and male genotype kl (i, j, k, l{1,…, A‘}). The large contingency table is collapsed into three counts, n₀, n₁ and n₂ where n_p is the number of couples with s alleles in common (s = 0,1, 2). The counts are estimated by np?_o where n₀, is the estimated probability of a couple having s alleles in common under the hypothesis of random mating. The usual chi-square goodness of fit statistic X² compares observed (n_s) with expected (np?) over the three categories, s = 0,1,2. An empirical observation has suggested that X² is close to having a chi-square distribution with two degrees of freedom (X) despite a large number of parameters implicitly estimated in _e. This paper gives two theorems which show that x is indeed the approximate distribution of X² for large n and K₁“, provided that no allele type over-dominates the others.     

Using principal components to test normality of high-dimensional data

Many multivariate statistical procedures are based on the assumption of normality and different approaches have been proposed for testing this assumption. The vast majority of these tests, however, are exclusively designed for cases when the sample size n is larger than the dimension of the variable p, and the null distributions of their test statistics are usually derived under the asymptotic case when p is fixed and n increases. In this article, a test that utilizes principal components to test for nonnormality is proposed for cases when p/n → c. The power and size of the test are examined through Monte Carlo simulations, and it is argued that the test remains well behaved and consistent against most nonnormal distributions under this type of asymptotics.     

Randomly weighted average with Dirichlet component proportions

This article introduces a new average of n independent continuous random variables X₁, …, X_n weighted by Dirichlet random components. A relation between the Cauchy–Stieltjes transforms of the distribution functions of this weighted average and X₁, …, X_n is established. Several examples illustrate usefulness and applicability of the result.