A note on LeCam’s bound for the distance between the Poisson binomial and the Poisson distribution

n possibly different success probabilities p ₁, p ₂, ..., p _n is frequently approximated by a Poisson distribution with parameter λ = p ₁ + p ₂ + ... + p _n . LeCam's bound p ² ₁ + p ² ₂ + ... + p _n ² for the total variation distance between both distributions is particularly useful provided the success probabilities are small. The paper presents an improved version of LeCam's bound if a generalized d-dimensional Poisson binomial distribution is to be approximated by a compound Poisson distribution. Received: May 10, 2000; revised version: January 15, 2001     

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.     

Optimum invariant tests for random manova models

Consider the canonical-form MANOVA setup with X: n × p = (+ E, X_i n_i × p, i = 1, 2, 3, M_i: n_i × p, i = 1, 2, n₁ + n₂ + n₃) p, where E is a normally distributed error matrix with mean zero and dispersion I_n (> 0 (positive definite). Assume (in contrast with the usual case) that M₁i is normal with mean zero and dispersion I_n1) and M₂2 is either fixed or random normal with mean zero and different dispersion matrix I_n2 (being unknown. It is also assumed that M₁ E, and M₂ (if random) are all independent. For testing H₀) = 0 versus H₁: (> 0, it is shown that when either n₂ = 0 or M₂ is fixed if n₂ > 0, the trace test of Pillai (1955) is uniformly most powerful invariant (UMPI) if min(n₁, p)= 1 and locally best invariant (LBI) if min(n₁ p) > 1 underthe action of the full linear group Gl (p). When p > 1, the LBI test is also derived under a somewhat smaller group G_T(p) of p × p lower triangular matrices with positive diagonal elements. However, such results do not hold if n₂ > 0 and M₂ is random. The null, nonnull, and optimality robustness of Pillai's trace test under Gl(p) for suitable deviations from normality is pointed out.     

Orderings for series and parallel systems comprising heterogeneous exponentiated Weibull-geometric components

Let X₁, …, X_n be independent random variables with X_i ～ EWG(α, β, λ_i, p_i), i = 1, …, n, and Y₁, …, Y_n be another set of independent random variables with Y_i ～ EWG(α, β, γ_i, q_i), i = 1, …, n. The results established here are developed in two directions. First, under conditions p₁ = ??? = p_n = q₁ = ??? = q_n = p, and based on the majorization and p-larger orders between the vectors of scale parameters, we establish the usual stochastic and reversed hazard rate orders between the series and parallel systems. Next, for the case λ₁ = ??? = λ_n = γ₁ = ??? = γ_n = λ, we obtain some results concerning the reversed hazard rate and hazard rate orders between series and parallel systems based on the weak submajorization between the vectors of (p₁, …, p_n) and (q₁, …, q_n). The results established here can be used to find various bounds for some important aging characteristics of these systems, and moreover extend some well-known results in the literature.     

Attainability of the Upper Bounds for the Mean Past Lifetime of Parallel System Components

Among reliability systems, one of the basic systems is a parallel system. In this article, we consider a parallel system consisting of n identical components with independent lifetimes having a common distribution function F. Under the condition that the system has failed by time t, with t being 100pth percentile of F(t = F ^?1(p), 0 < p < 1), we characterize the probability distributions based on the mean past lifetime of the components of the system. These distributions are described in the form of a specific shape on the left of t and arbitrary continuous function on the right tail.     

Limiting distributions of Kolmogorov-Lévy-type statistics under the alternative

Let X_i, 1 ≤ i ≤ n, be independent identically distributed random variables with a common distribution function F, and let G be a smooth distribution function. We derive the limit distribution of □{ρ_α(F_n, G) - _α(F, G)}, where F_n is the empirical distribution function based on X₁,…,X_n and _α is a Kolmogorov-Lévy-type metric between distribution functions. For α ≤ 0 and two distribution functions F and G the metric p_α is given by p_α(F, G) = inf {? ≤ 0: G(x - α?) - ? F(x) ≤ G(x + α?) + ? for all x ?}.     

Testing homogeneity of several covariance matrices and multi-sample sphericity for high-dimensional data under non-normality

A test for homogeneity of g ? 2 covariance matrices is presented when the dimension, p, may exceed the sample size, n_i, i = 1, …, g, and the populations may not be normal. Under some mild assumptions on covariance matrices, the asymptotic distribution of the test is shown to be normal when n_i, p → ∞. Under the null hypothesis, the test is extended for common covariance matrix to be of a specified structure, including sphericity. Theory of U-statistics is employed in constructing the tests and deriving their limits. Simulations are used to show the accuracy of tests.     

Robust Confidence Intervals for the Bernoulli Parameter

Despite the simplicity of the Bernoulli process, developing good confidence interval procedures for its parameter—the probability of success p—is deceptively difficult. The binary data yield a discrete number of successes from a discrete number of trials, n. This discreteness results in actual coverage probabilities that oscillate with the n for fixed values of p (and with p for fixed n). Moreover, this oscillation necessitates a large sample size to guarantee a good coverage probability when p is close to 0 or 1.

It is well known that the Wilson procedure is superior to many existing procedures because it is less sensitive to p than any other procedures, therefore it is less costly. The procedures proposed in this article work as well as the Wilson procedure when 0.1 ≤p ≤ 0.9, and are even less sensitive (i.e., more robust) than the Wilson procedure when p is close to 0 or 1. Specifically, when the nominal coverage probability is 0.95, the Wilson procedure requires a sample size 1, 021 to guarantee that the coverage probabilities stay above 0.92 for any 0.001 ≤ min {p, 1 ?p} <0.01. By contrast, our procedures guarantee the same coverage probabilities but only need a sample size 177 without increasing either the expected interval width or the standard deviation of the interval width.     

Expected and unexpected values of individual Mahalanobis distances

This paper derives first-order sampling moments of individual Mahalanobis distances (MDs) in cases when the dimension p of the variable is proportional to the sample size n. Asymptotic expected values when n, p → ∞ are derived under the assumption p/n → c,?0 ? c < 1. It is shown that some types of standard estimators remain unbiased in this case, while others are asymptotically biased, a property that appears to be unnoticed in the literature. Second-order moments are also supplied to give some additional insight to the matter.     

ON TESTING AGAINST RESTRICTED ALTERNATIVES FOR THE VARIANCES OF GAUSSIAN MODELS

Let π₁,…,π_p be p independent normal populations with means μ₁…, μ_p and variances σ²₁,…, σ²_p respectively. Let X(n_i) be a simple random sample of size n_i from π_i, i = 1,…,p. Given the simple random samples X(n₁),…, X(n_p) from π₁,…,π_p respectively, a test has been proposed for testing the homogeneity of variances H₀: σ²₁=…σ²_p, against the restricted alternative, H₁: σ²₁≥…≥σ²_p, with at least one strict inequality. Some properties of the test are discussed and critical values are tabulated.     

Regularized proportional odds models

The proportional odds model (POM) is commonly used in regression analysis to predict the outcome for an ordinal response variable. The maximum likelihood estimation (MLE) approach is typically used to obtain the parameter estimates. The likelihood estimates do not exist when the number of parameters, p, is greater than the number of observations n. The MLE also does not exist if there are no overlapping observations in the data. In a situation where the number of parameters is less than the sample size but p is approaching to n, the likelihood estimates may not exist, and if they exist they may have quite large standard errors. An estimation method is proposed to address the last two issues, i.e. complete separation and the case when p approaches n, but not the case when p>n. The proposed method does not use any penalty term but uses pseudo-observations to regularize the observed responses by downgrading their effect so that they become close to the underlying probabilities. The estimates can be computed easily with all commonly used statistical packages supporting the fitting of POMs with weights. Estimates are compared with MLE in a simulation study and an application to the real data.     

On moments of the supremum of normed weighted averages

Let {X, X_n; n ≥ 1} be a sequence of real-valued iid random variables, 0 < r < 2 and p > 0. Let D = { A = (a_nk; 1 ≤ k ≤ n, n ≥ 1); a_nk, ? R and sup_{n, k} |a_n,k| < ∞}. Set S_n( A ) = ∑ⁿ_k=1a_{n, k}X_k for A ? D and n ≥ 1. This paper is devoted to determining conditions whereby E{sup_{n ≥ 1}, |S_n( A )|/n^1/r}^p < ∞ or E{sup_{n ≥ 2} |S_n( A )|/2n log n)^1/2}^p < ∞ for every A ? D. This generalizes some earlier results, including those of Burkholder (1962), Choi and Sung (1987), Davis (1971), Gut (1979), Klass (1974), Siegmund (1969) and Teicher (1971).     

A Variation on the Coupon Collecting Problem

The classical coupon collector's problem is considered, where each new coupon collected is type i with probability p_i , ∑ ⁿ _{i = 1} p_i = 1. Suppose coupons are collected in a sequence of independent trials. An expression is developed for the probability that all coupon types i, i ≠ j, have been collected prior to collecting r ? 1 coupons of type j in the sequence of trials. Given two different coupon subsets A, B of {1, 2, …, n}, the foregoing is then generalized to an expression for the probability that s ? 1 copies of A appear in the sequence of trials before r ? 1 copies of B. Some computational considerations are discussed.     

Moments of Order Statistics from Weibull Distribution in the Presence of Multiple Outliers

In this article, we derive exact expressions for the single and product moments of order statistics from Weibull distribution under the contamination model. We assume that X₁, X₂, …, X_{n ? p} are independent with density function f(x) while the remaining, p observations (outliers) X_{n ? p + 1}, …, X_n are independent with density function arises from some modified version of f(x), which is called g(x), in which the location and/or scale parameters have been shifted in value. Next, we investigate the effect of the outliers on the BLUE of the scale parameter. Finally, we deduce some special cases.     

Lp convergence and complete convergence for weighted sums of AANA random variables

Let {X_n, n ? 1} be a sequence of asymptotically almost negatively associated (AANA, for short) random variables which is stochastically dominated by a random variable X, and {d_ni, 1 ? i ? n, n ? 1} be a sequence of real function, which is defined on a compact set E. Under some suitable conditions, we investigate some convergence properties for weighted sums of AANA random variables, especially the L^p convergence and the complete convergence. As an application, the Marcinkiewicz–Zygmund-type strong law of large numbers for AANA random variables is obtained.     

On a problem of counting by weighing

Suppose it is desired to obtain a large number N_s of items for which individual counting is impractical, but one can demand a batch to weigh at least w units so that the number of items N in the batch may be close to the desired number N_s. If the items have mean weight ωTH, it is reasonable to have w equal to ωTHN_s when ωTH is known. When ωTH is unknown, one can take a sample of size n, not bigger than N_s, estimate ωTH by a good estimator ω_n, and set w equal to ω_nN_s. Let R_n = Kp²N²_s/n + K_sn be a measure of loss, where K_e and K_s are the coefficients representing the cost of the error in estimation and the cost of the sampling respectively, and p is the coefficient of variation for the weight of the items. If one determines the sample size to be the integer closest to pCN_s when p is known, where C is (K_e/K_s)^1/2, then R_n will be minimized. If p is unknown, a simple sequential procedure is proposed for which the average sample number is shown to be asymptotically equal to the optimal fixed sample size. When the weights are assumed to have a gamma distribution given ω and ω has a prior inverted gamma distribution, the optimal sample size can be found to be the nonnegative integer closest to pCN_s + p²A(pC – 1), where A is a known constant given in the prior distribution.     

Expected Absolute Error of the Usual Estimator of the Binomial Parameter

For X with binomial (n, p) distribution the usual measure of the error of X/n as an estimator of p is its standard error S_n(p) = √{E(X/n – p)²} = √{p(1 – p)/n}. A somewhat more natural measure is the average absolute error D_n(p) = E‖X/n – p‖. This article considers use of D_n(p) instead of S_n(p) in a student's first introduction to statistical estimation. Exact and asymptotic values of D_n(p), and the appearance of its graph, are described in detail. The same is done for the Poisson distribution.     

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.     

Bad Probability,Good Statistics,and Group Testing for Binomial Estimation

This article examines some improperly stated but often used textbook probability problems. Moving from a probabilistic to a statistical setting provides insight into group testing (i.e., observing only whether one or more of a group responds and not the response of each individual). Exact methods are used to construct tables showing (i) that group testing n times to estimate p can be more efficient than n individual tests even for small n and large p, (ii) optimal grouping strategies for various (n, p) combinations, and (iii) the efficiencies and biases achieved.     

Sequential Estimation of Expectations in the Presence of Trend2

A sequence of independent random variables {Z_n:n≥ 1} with unknown probability distributions is considered and the problem of estimating their expectations {M_n+1: n≥ 1} is examined. The estimation of M_n+1 is based on a finite set {z_k:1≤k≤n}, each z_k being an observed value of Z_k, 1 ≤k≤n, and also based on the assumption that {M_n:n≥ 1} follows an unknown trend of a specified form.