On a conjecture concerning the least favorable configuration of a two-stage selection procedure

A two-stage procedure 𝓅with screening in the first stage to find the population with the largest mean out of k ≧ 2 normal populations with unknown means and a common variance is under concern. It was proposed and previousiy studied by Cohen (1959), Alam (1970) and Tamhane and Bechhofer (1977, 1979) using the indifference-zone approach. The conjecture that the least favourable parameter configuration for the probability of a correct selection is of the slippage type remained unproved for k ≧ 3. Miescke and Sehr (1980) proved the conjecture for k=3. The problem was further discussed by Gupta and Miescke (1982). A general proof for rhe conjecture will be given in this paper.     

A class of fixed-width confidence intervals for a ranked normal mean

Suppose that we are given k(≥ 2) independent and normally distributed populations π₁, …, π_k where π_i has unknown mean μ_i and unknown variance σ² _i (i = 1, …, k). Let μ_[i] (i = 1, …, k) denote the i^th smallest one of μ₁, …, μ_k. A two-stage procedure is used to construct lower and upper confidence intervals for μ_[i] and then use these to obtain a class of two-sided confidence intervals on μ_[i] with fixed width. For i = k, the interval given by Chen and Dudewicz (1976) is a special case. Comparison is made between the class of two-sided intervals and a symmetric interval proposed by Chen and Dudewicz (1976) for the largest mean, and it is found that for large values of k at least one of the former intervals requires a smaller total sample size. The tables needed to actually apply the procedure are provided.     

Testing for and against a set of linear inequality constraints in a multinomial setting

There are numerous situations in categorical data analysis where one wishes to test hypotheses involving a set of linear inequality constraints placed upon the cell probabilities. For example, it may be of interest to test for symmetry in k × k contingency tables against one-sided alternatives. In this case, the null hypothesis imposes a set of linear equalities on the cell probabilities (namely p_ij = P_ji ×i > j), whereas the alternative specifies directional inequalities. Another important application (Robertson, Wright, and Dykstra 1988) is testing for or against stochastic ordering between the marginals of a k × k contingency table when the variables are ordinal and independence holds. Here we extend existing likelihood-ratio results to cover more general situations. To be specific, we consider testing H_t,0 against H₁ - H₀ and H₁ against H₂ - H ₁ when H₀:k × i=1 p_ix_ji = 0, j = 1,…, s, H₁:k × i=1 p_ix_ji × 0, j = 1,…, s, and does not impose any restrictions on p. The x_ji's are known constants, and s × k - 1. We show that the asymptotic distributions of the likelihood-ratio tests are of chi-bar-square type, and provide expressions for the weighting values.     

On a conjecture of Kakosyan,Klebanov and Melamed

Suppose X₁, X₂, ..., X_m is a random sample of size m from a population with probability density function f(x), x>0 and let X_1,m<...m,m be the corresponding order statistics. We assume m as an integer valued random variable with P(m=k)=p(1?p)^k?1, k=1, 2, ... and 0 and n X_1,n for fixed n characterizes the exponential distribution. In this paper we prove that under the assumption of monotone hazard rate the identical distribution of and (n?r+1) (X_r,n?X_r?1,n) for some fixed r and n with 1≤r≤n, n≥2, X_0,n=0, characterizes the exponential distribution. Under the assumption of monotone hazard rate the conjecture of Kakosyan, Klebanov and Melamed follows from the above result with r=1.     

A one-sided test for testino homogeneity of scale parameters against simple ordered alternative

In an earlier paper the authors (1997) extended the results of Hayter (1990) to the two parameter exponential probability model. This paper addressee the extention to the scale parameter case under location-scale probability model. Consider k (k≧3) treatments or competing firms such that an observation from with treatment or firm follows a distribution with cumulative distribution function (cdf) F_i(x)=F[(x-μ_i)/Q_i], where F(·) is any absolutely continuous cdf, i=1,…,k. We propose a test to test the null hypothesis H₀:θ₁=…=θ_k against the simple ordered alternative H₁:θ₁≦…≦θ_k, with at least one strict inequality, using the data X_i,j, i=1,…k; j=1,…,n₁. Two methods to compute the critical points of the proposed test have been demonstrated by talking k two parameter exponential distributions. The test procedure also allows us to construct simultaneous one sided confidence intervals (SOCIs) for the ordered pairwise ratios θ_j/θ_i, 1≦i<j≦k. Statistical simulation revealed that: 9i) actual sizes of the critical points are almost conservative and (ii) power of the proposed test relative to some existing tests is higher.     

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.     

Discrimination analysis when the variates are grouped and observed in sequential order

Suppose that measurements Math', i = l,....,k, are consecutively taken on an individual at the prescribed costs C_i, i = l,....,k. the individual comes from one of the two populations H₁ and H₂, and it is desired to detect which population the individual belongs to. Given the loss incurreed in selecting population H_r when in fact it belongs to H_s, the prior probability P_r of H_r (r = 1,2), and assuming that H_r has the normal distribution N(µ_r, V), r = 1,2, we derive the sequential Bayesian solution of the discrimination problem when µ₁, µ₂ and V are known. When µ_r, V are unknown and must be estimated, we propose a solution which is asymptotic Bayesian with exponential convergence rate.     

An inequality for random replacement sampling plans

A sample (X₁ …, X_n) is drawn from a population of size N. Karlin (1974) conjectured that for any function ? in a certain class of real-valued functions on the sample space, ? is at least as large for sampling with replacement as for any other random replacement sampling plan. This conjecture is proved under the assumption that ?     

Maximum likelihood estimation of the parameters of the bivariate binomial distribution

We consider the problem of maximum likelihood estimation of the parameters of the bxvariate binomial distribution, In the statistical literature, this problem is solved when the observed sample is available in the form of a 2x2 contingency table, that is, with all four cell fre quencies given,, The present paper provides a solution for this problem when only the marginal totals of the 2x2 table are observed, which is the natural set-up in a bivariate sampling situation.. Thus, based on a sample [(X_i,Y_i:), i = 1, …, k] from a bivariate binomial population, we derive maximum likelihood (ML) estimators for the two marginal parameters p₁,p₂: and the covariance parameter p₁₁: It. turns out that the ML estimators for P₁: and P₂: are expressed explicitly in terms of the sample values, whereas the ML estimator for p₁₁: can only be obtained numerically by iterative methods Two nu merical illustrations are also presented     

Maximum likelihood estimation for arma models in the presence of ARMA errors

An ARMA(p, q) process observed with an ARMA(c, d) error has an ARMA (p + c, k) representation with k = max(c + q, p + d) whose parameters satisfy some nonlinear constraints. Identification of the model is discussed. We develop Newton-Raphson estimators for the ARMA(p + c, k) process which take advantage of the information contained in the nonlinear restrictions. Explicit expressions for the derivatives of the restrictions are derived.     

THE CONVERGENCE RATE OF SEQUENTIAL FIXED-WIDTH CONFIDENCE INTERVALS FOR REGULAR FUNCTIONALS

Let X₁X₂,.be i.i.d. random variables and let U_n= (n r)^-1S?^(n,r) h (X_i1,., X_ir,) be a U-statistic with EU_n= v, v unknown. Assume that g(X₁) =E[h(X₁,.,X_r) - v |X₁]has a strictly positive variance s?². Further, let a be such that φ(a) - φ(-a) =α for fixed α, 0 < α < 1, where φ is the standard normal d.f., and let S²_n be the Jackknife estimator of n Var U_n. Consider the stopping times N(d)= min {n: S²_n: + n^-1≤²a^-2},d > 0, and a confidence interval for v of length 2d,of the form I_n,d= [U_n,-d, Un + d]. We assume that Var U_n is unknown, and hence, no fixed sample size method is available for finding a confidence interval for v of prescribed width 2d and prescribed coverage probability α Turning to a sequential procedure, let I_N(d),d be a sequence of sequential confidence intervals for v. The asymptotic consistency of this procedure, i.e. lim_{d → 0}P(v ∈ I_N(d),d)=α follows from Sproule (1969). In this paper, the rate at which |P(v ∈ I_N(d),d) converges to α is investigated. We obtain that |P(v ∈ I_N(d),d) - α| = 0 (d^{1/2-(1+k)/2(1+m)}), d → 0, where K = max {0,4 - m}, under the condition that E|h(X₁, X_r)|^m < ∞m > 2. This improves and extends recent results of Ghosh & DasGupta (1980) and Mukhopadhyay (1981).     

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.     

NON-EXISTENCE OF AN EXACT β-CONFIDENCE INTERVAL FOR A SCALE PARAMETER*

Abstract There are given k (≥22) independent distributions with c.d.f.'s F(x;θ_j) indexed by a scale parameter θ_j, j = 1,…, k. Let θ_[i] (i = 1,…, k) denote the ith smallest one of θ₁,…, θ_k. In this paper we wish to show that, under some regularity conditions, there does not exist an exact β-level (0≤β1) confidence interval for the ith smallest scale parameter θ_i based on k independent samples. Since the log transformation method may not yield the desired results for the scale parameter problem, we will treat the scale parameter case directly without transformation. Application is considered for normal variances. Two conservative one-sided confidence intervals for the ith smallest normal variance and the percentage points needed to actually apply the intervals are provided.     

Optimal linear combinations using householder transformations

In pattern classification of sampled vector valued random variables it is often essential, due to computational and accuracy considerations, to consider certain measurable transformations of the random variable. These transformations are generally of a dimension-reducing nature. In this paper we consider the class of linear dimension reducing transformations, i.e., the k × n matrices of rank k where k < n and n is the dimension of the range of the sampled vector random variable.

In this connection, we use certain results (Decell and Quirein, 1973), that guarantee, relative to various class separability criteria, the existence of an extremal transformation. These results also guarantee that the extremal transformation can be expressed in the form (I_k∣ Z)U where I_k is the k × k identity matrix and U is an orthogonal n × n matrix. These results actually limit the search for the extremal linear transformation to a search over the obviously smaller class of k × n matrices of the form (I_k ∣Z)U. In this paper these results are refined in the sense that any extremal transformation can be expressed in the form (I_K∣Z)H_p … H₁ where p ≤ min{k, n?k} and H_i is a Householder transformation i=l,…, p, The latter result allows one to construct a sequence of transformations (L_K∣ Z)H₁, (I_K Z)H₂H₁ … such that the values of the class separability criterion evaluated at this sequence is a bounded, monotone sequence of real numbers. The construction of the i-th element of the sequence of transformations requires the solution of an n-dimensional optimization problem. The solution, for various class separability criteria, of the optimization problem will be the subject of later papers. We have conjectured (with supporting theorems and empirical results) that, since the bounded monotone sequence of real class separability values converges to its least upper bound, this least upper bound is an extremal value of the class separability criterion.

Several open questions are stated and the practical implications of the results are discussed.     

A New Family of Nonparametric Quantile Estimators

A new core methodology for creating nonparametric L-quantile estimators is introduced and three new quantile L-estimators (SV1 _p , SV2 _p , and SV3 _p ) are constructed using the new methodology. Monte Carlo simulation was used in order to investigate the performance of the new estimators for small and large samples under normal distribution and a variety of light and heavy-tailed symmetric and asymmetric distributions. The new estimators outperform, in most of the cases studied, the Harrell–Davis quantile estimator and the weighted average at X _([np]) quantile estimator.     

Local asymptotic normality of intermediate and central order statistics

Consider n independent random variables Z_i,…, Z_n on R with common distribution function F, whose upper tail belongs to a parametric family F(t) = F_θ(t),t ≥ x₀, where θ ∈ ? ? R ^d. A necessary and sufficient condition for the family F_θ, θ ∈ ?, is established such that the k-th largest order statistic Z_n?k+1:n alone constitutes the central sequence yielding local asymptotic normality ( LAN ) of the loglikelihood ratio of the vector (Z_n?i+1:n)¹ _i=kof the k largest order statistics. This is achieved for k = k(n)→_n→∞∞ with k/n→_n→∞ 0.

In the case of vectors of central order statistics ( Z_r:n, Z_r+1:n,…, Z_s:n ), with r/n and s/n both converging to q ∈ ( 0,1 ), it turns out that under fairly general conditions any order statistic Z_m:n with r ≤ m ≤s builds the central sequence in a pertaining LAN expansion.These results lead to asymptotically optimal tests and estimators of the underlying parameter, which depend on single order statistics only     

SELECTION PROCEDURES FOR SCALE PARAMETERS USING TWO-SAMPLE U-STATISTICS

Let be k independent populations having the same known quantile of order p (0 p 1) and let F(x)=F(x/_i) be the absolutely continuous cumulative distribution function of the ith population indexed by the scale parameter ₁, i = 1,…, k. We propose subset selection procedures based on two-sample U-statistics for selecting a subset of k populations containing the one associated with the smallest scale parameter. These procedures are compared with the subset selection procedures based on two-sample linear rank statistics given by Gill & Mehta (1989) in the sense of Pitman asymptotic relative efficiency, with interesting results.     

Asymptotic properties of the GMLE in the case 1 interval-censorship model with discrete inspection times

We consider the case 1 interval censorship model in which the survival time has an arbitrary distribution function F₀ and the inspection time has a discrete distribution function G. In such a model one is only able to observe the inspection time and whether the value of the survival time lies before or after the inspection time. We prove the strong consistency of the generalized maximum-likelihood estimate (GMLE) of the distribution function F₀ at the support points of G and its asymptotic normality and efficiency at what we call regular points. We also present a consistent estimate of the asymptotic variance at these points. The first result implies uniform strong consistency on [0, ∞) if F₀ is continuous and the support of G is dense in [0, ∞). For arbitrary F₀ and G, Peto (1973) and Tumbull (1976) conjectured that the convergence for the GMLE is at the usual parametric rate n½ Our asymptotic normality result supports their conjecture under our assumptions. But their conjecture was disproved by Groeneboom and Wellner (1992), who obtained the nonparametric rate ni under smoothness assumptions on the F₀ and G.     

Some reliability properties of order statistics

Let X_i:j denote the i^th order statistic of a random sample of size j from a continuous life distribution. We show that if X_k:n, is IFR, IFRA, NBU, or DMRL, so are X_k+1:n, X_k+1:n?1 and X_k+1:n+1. Further we show that, in the first three cases, X_k+1:n+2 also shares the corresponding property if k ≤ (n+3)/2. We also present dual results for DFR, DFRA and NWU classes.