Kolmogorov-type tests of goodness-of-fit against stochastic ordering

This article addresses the problem of testing the null hypothesis H₀ that a random sample of size n is from a distribution with the completely specified continuous cumulative distribution function F_n(x). Kolmogorov-type tests for H₀ are based on the statistics C⁺ _n = Sup[F_n(x)?F₀(x)] and C^? _n=Sup[F₀(x)?F_n(x)], where F_n(x) is an empirical distribution function. Let F(x) be the true cumulative distribution function, and consider the ordered alternative H₁: F(x)≥F₀(x) for all x and with strict inequality for some x. Although it is natural to reject H₀ and accept H₁ if C ⁺ _n is large, this article shows that a test that is superior in some ways rejects F₀ and accepts H₁ if C^mdash _n is small. Properties of the two tests are compared based on theoretical results and simulated results.     

Modified kolmogorov-smirnov tests of goodness of fit

The Kolmogorov-Smirnov (K–S) one-sided and two-sided tests of goodness of fit based on the test statistics D⁺ _n D^? _n and D_n are equivalent to tests based on taking the cumulative probability of the i–th order statistic of a sample of size n to be (i–.5)/n. Modified test statistics C⁺ _n, C^? _n and C_n are obtained by taking the cumulative probability to be i/(n+l). More generally, the cumula-tive probability may be taken to be (i?δ)/(n+l?2δ), as suggested by Blom (1958), where 0 less than or equal δ less than or equal .5. Critical values of the test statis-tics can be found by interpolating inversely in tables of the proba-bility integrals obtained by setting a=l/(n+l?2δ) in an expression given by Pyke (1959). Critical values for the D's (corresponding to δ=.5) have been tabulated to 5DP by Miller (1956) for n=1(1)100. The authors have made analogous tabulations for the C's (corresponding to δ=0) [previously tabulated by Durbin (1969) for n=1(1)60(2)100] and for the test statistics E⁺ _n, E^? _n and E_n corresponding to δ f.3. They have also made a Monte Carlo comparison of the power of the modified tests with that of the K–S test for several hypothetical distributions. In a number of cases, the power of the modified tests is greater than that of the K–S test, especially when the standard deviation is greater under the alternative than under the null hypo-thesis.     

Failure–censored reliability sampling plans for the exponential distribution

In this paper we examine the failure-censored sampling plans for the two–parameter exponential distri- bution based on m random samples, each of size n. The suggested procedure is based on exact results and only the first failure time of each sample is needed. The values of the acceptability constant are also tabulated for selected values of p _α ¹ p _β ¹, α and β. Further, a comparison of the proposed sampling plans with ordinary sampling plans using a sample of size mn is made. When compared to ordinary sampling plans, the proposed plan has an advantage in terms of shorter test-time and a saving of resources.     

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.     

Robustness of the two-sample t-test umdeh violations of the homogeneity of farjance assumptioi

When the two-sample t-test has equal sample slies, it is widely considered to be a robust procedure (with respect to the significaoce level) under violatioa of the assuaptioo of equal variances. This paper is coa-earned with a quantification of the amount of robustness which this procedure has under such violations, The approach is through the concept of "religion of robustness" and the resluts show an extremely strong degree of robustness for the equal an extremely strong degree of robustness for the equal sample size t-test, probably more so than most statistyicians realise. This extremely high level of robustness, however, reduces quickly as the sample sizes begin to vary from equality. The regions of robustnes obtained show that while most users would likely be satisfied with the degree of robustness inherent when the two sample sizes each vary by 10% from equality, most would wish to be much more cautions when the variation is 20%. The study covers sample sizes n₁ -= n ² = 5(5)30(10)50 plus 10% and 20% variations thereof for the two-tailed test and nominal significance levels of 0.01 and 0.05.     

Selecting the normal population with the smallest variance: A restricted subset selection rule

Consider k( ? 2) normal populations whose means are all known or unknown and whose variances are unknown. Let σ²_[1] ? ??? ? σ_[k]² denote the ordered variances. Our goal is to select a non empty subset of the k populations whose size is at most m(1 ? m ? k ? 1) so that the population associated with the smallest variance (called the best population) is included in the selected subset with a guaranteed minimum probability P* whenever σ²_[2]/σ_[1]² ? δ* > 1, where P* and δ* are specified in advance of the experiment. Based on samples of size n from each of the populations, we propose and investigate a procedure called R_BCP. We also derive some asymptotic results for our procedure. Some comparisons with an earlier available procedure are presented in terms of the average subset sizes for selected slippage configurations based on simulations. The results are illustrated by an example.     

Randomly weighted sums and their maxima with heavy-tailed increments and dependence structure

Consider the randomly weighted sums S_m(θ) = ∑^m_{i = 1}θ_iX_i, 1 ? m ? n, and their maxima M_n(θ) = max?_{1 ? m ? n}S_m(θ), where X_i, 1 ? i ? n, are real-valued and dependent according to a wide type of dependence structure, and θ_i, 1 ? i ? n, are non negative and arbitrarily dependent, but independent of X_i, 1 ? i ? n. Under some mild conditions on the right tails of the weights θ_i, 1 ? i ? n, we establish some asymptotic equivalence formulas for the tail probabilities of S_n(θ) and M_n(θ) in the case where X_i, 1 ? i ? n, are dominatedly varying, long-tailed and subexponential distributions, respectively.     

Small sample distribution for a nonparametric test for trend

The exact distribution of a nonparametric test statistic for ordered alternatives, the _rank ² statistic, is computed for small sample sizes. The exact distribution is compared to an approximation.     

Estimation of the sum of differences distribution

Consider the distribution of Z_i d_iwhere the d.d_i?s are 1=1 lldifferences independently, identically and symmetrically distributed with mean zero. The problem is to determine properties of the sdd given the distribution of the d._i?fs and the sample size n. The standardized moments as a function of the moments of the d._i!s are developed. A variance reduction technique for estimating the quantiles of the sdd using Monte Carlo methods is developed based on using the randomization sample consisting of the 2ⁿ values of Z _i+d. rather than the single observation i=l lZ d. corresponding to each sample d_id_n. The randomization sample is shown to produce unbiased and consistent estimators.     

Uniform convergence of an empirical cdf based on a relatively small number of order statistics

An empirical distribution function F_m, defined on a subset of order statistics of a random sample of size n taken from the distribution of a random variable with continuous distribution function F, is shown to converge uniformly with probability one to F. Small sample distributions of the one and two sided deviations and the asymptotic normality of the standardized F_m are established. The relative efficiency of F_m as compared to the classical empirical distribution function is calculated and tabled. for n = 10, 20, 50, 100, 200.     

Upper tolerance limit for the largest observation from censored samples

This paper deals with obtaining an upper tolerance limit for a largest observation X_(n) in an ordered sample of size n from a continuous distribution where the first m observations X₍₁₎ < X₍₂₎ < … < X_(m), l ≤ m < n, have been observed. A criterion of “goodness” of tolerance limit is developed, and a method is given to obtain the best tolerance limit. This method is applied to exponential and Pareto distributions.     

A GALTON-WATSON BRANCHING PROCESS IN VARYING ENVIRONMENTS WITH ESSENTIALLY CONSTANT OFFSPRING MEANS AND TWO RATES OF GROWTH1

A Galton-Watson process in varying environments (Z_n), with essentially constant offspring means, i.e. E(Z_n)/mⁿ→α∈(0, ∞), and exactly two rates of growth is constructed. The underlying sample space Ω can be decomposed into parts A and B such that (Z_n)_n grows like 2ⁿon A and like mⁿon B (m > 4).     

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).     

Variance Components Testing in ANOVA‐Type Mixed Models

The purpose of this article is threefold. First, variance components testing for ANOVA ‐type mixed models is considered, in which response may not be divided into independent sub‐vectors, whereas most of existing methods are for models where response can be divided into independent sub‐vectors. Second, testing that a certain subset of variance components is zero. Third, as normality is often violated in practice, it is desirable to construct tests under very mild assumptions. To achieve these goals, an adaptive difference‐based test and an adaptive trace‐based test are constructed. The test statistics are asymptotically normal under the null hypothesis, are consistent against all global alternatives and can detect local alternatives distinct from the null at a rate as close to n ^{? 1 ∕ 2} as possible with n being the sample size. Moreover, when the dimensions of variance components in different sets are bounded, we develop a test with chi‐square as its limiting null distribution. The finite sample performance of the tests is examined via simulations, and a real data set is analysed for illustration.     

SELECTING THE m POPULATIONS WITH LARGEST MEANS FROM k NORMAL POPULATIONS WITH UNKNOWN VARIANCES

This paper gives a two-sample procedure for selecting the m populations with the largest means from k normal populations with unknown variances. The method is a generalization of a recent work by Ofosu [1973] and hence should find wider practical applications. The experimenter takes an initial sample of preset size N₀ from each population and computes an unbiased estimate of its variance. From this estimate he determines the second sample size for the population according to a table presented for this purpose. The populations associated with the m largest overall sample means will be selected. The procedure is shown to satisfy a confidence requirement similar to that of Ofosu.     

A note on hazard rates of order statistics

Let F_k:m be the cumulative disribution function of the kth order statistic in a sample of size n from a distribution

F(x) with density function f(x).The primary objective of this paper is to show that F_k+1mis IHR(increasing hazard rate) if F_km(x)is IHH and that F_k-1:n(x)is DHR.(decreasing hazard rate) if F_km(x) is DHR.     

Large sample theory of the Langevin distribution

The Langevin (or von Mises-Fisher) distribution of random vector x on the unit sphere ω_q in $\text{R}$^q has a density proportional to exp κμ'x where μ'x is the scalar product of x with the unit modal vector μ and κ?0 is a concentration parameter. This paper studies estimation and tests for a wide variety of situations when the sample sizes are large. Geometrically simple test statistics are given for many sample problems even when the populations may have unequal concentration parameters.     

Confidence Intervals for Nonparametric Regression Functions with Missing Data

Suppose that we have a nonparametric regression model Y = m(X) + ε with X ∈ R^p, where X is a random design variable and is observed completely, and Y is the response variable and some Y-values are missing at random. Based on the “complete” data sets for Y after nonaprametric regression imputation and inverse probability weighted imputation, two estimators of the regression function m(x₀) for fixed x₀ ∈ R^p are proposed. Asymptotic normality of two estimators is established, which is used to construct normal approximation-based confidence intervals for m(x₀). We also construct an empirical likelihood (EL) statistic for m(x₀) with limiting distribution of χ²₁, which is used to construct an EL confidence interval for m(x₀).     

On the construction of hypercubic design

Hypercubic design was introduced by Shah (1958) and Kusumoto(1965) in which the t=v^m treatments are represented by n-plets (x₁, x₂, ..., x_m),where 1≤ x₁, x₂, ..., x_m ≤v, and two treatments are said to be i-th associates if they differ in exactly i components. This paper deals with the construction of some hypercubic designs and gives their application to confounding plans for symmetrical factorial experiments. The proposed methods prove to be quite flexible in terms of choice of possible block sizes and are easy to use.