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.     

A note on some negative dependence notions

A random vector X = (X ₁,…,X _n ) is negatively associated if and only if for every pair of partitions X ₁ = (X _π(1),…,X _π(k)), X ₂ = (X _π(k+1),…,X _π(n)) of X , P( X ₁ ? A, X ₂ ? B) ≤ P( X ₁ ? A)P( X ₂ ? B) whenever A and B are open upper sets and π is any permutation of {1,…,n}. In this paper, we develop some of concepts of negative dependence, which are weaker than negative association but stronger than negative orthant dependence by requiring the above inequality to hold only for some upper sets A and B and applying the arguments in Shaked.     

On selecting a subset which contains all populations better than a control

Let π₁…, π_k denote k(≥ 2) populations with unknown means μ₁ , …, μ_k and variances σ₁ ² , …, σ_k ² , respectively and let π_o denote the control population having mean μ_o and variance σ_o ² . It is assumed that these populations are normally distributed with correlation matrix {ρ_ij}. The goal is to select a subset, of populations of π₁ , …, π_k which contains all the populations with means larger than or equal to the mean of the control one. Procedures are given for selecting such a subset so that the probability that all the populations with means larger than or equal to the mean of the control one are included in the selected subset is at least equal to a predetermined value P?(l/k < P? < 1). The goal treated here is a first step screening procedure that allows the experimenter to choose a subset and withhold judgement about which one has the largest mean. Then, if the one with the largest mean is desired it can be chosen from the selected subset on the basis of cost and other considerations. Percentage points are also included.     

Changepoint Problems Under Random Censorship

Let X ₁, …, X _[nθ], X _{[nθ] + 1}, …, X _n be a sequence of independent random variables (the “lifetimes”) such that X _j ? F ₁ for 1 ≤ j ≤ [nθ] and X _j ? F ₂ for [nθ] + 1 ≤ j ≤ n, with F ₁ ≠ F ₂ unknown. In this paper we investigate an estimator θ _n for the changepoint θ if the X's are subject to censoring. The rate of almost sure convergence of θ _n to θ is established and a test for the hypothesis θ = 0, i.e. “no change”, is proposed.     

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.     

Prediction based on linear combinations of order statistics and bivariate concomitants in the case of multivariate elliptical distributions

In this paper, by considering a (3n+1) -dimensional random vector (X₀, X^T, Y^T, Z^T)^T having a multivariate elliptical distribution, we derive the exact joint distribution of (X₀, a^TX_(n), b^TY_[n], c^TZ_[n])^T, where a, b, c∈?ⁿ, X_(n)=(X₍₁₎, …, X_(n))^T, X₍₁₎<···<X_(n), is the vector of order statistics arising from X, and Y_[n]=(Y_[1], …, Y_[n])^T and Z_[n]=(Z_[1], …, Z_[n])^T denote the vectors of concomitants corresponding to X_(n) ((Y_[r], Z_[r])^T, for r=1, …, n, is the vector of bivariate concomitants corresponding to X_(r)). We then present an alternate approach for the derivation of the exact joint distribution of (X₀, X_(r), Y_[r], Z_[r])^T, for r=1, …, n. We show that these joint distributions can be expressed as mixtures of four-variate unified skew-elliptical distributions and these mixture forms facilitate the prediction of X_(r), say, based on the concomitants Y_[r] and Z_[r]. Finally, we illustrate the usefulness of our results by a real data.     

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.     

Subset selection procedures for ΔP-superior populations

In some ranking and selection problems it is reasonable to consider any population which is inferior but sufficiently close to the best (t-th best) as acceptable. Under this assumption, this paper studies classes of procedures to meet two possible goals. A and B. Goal A is to select a subset which contains only good populations, while Goal B is of a screening nature and requires selection of a subset of size not exceeding m (1 ≤ m ≤ k) and containing at least one good population. In each case results loading to the determination of the sample size required to attain the goals above with prespecified probability are obtained. Properties of the procedures are discussed.     

A Subset Selection Procedure for Selecting the Exponential Population Having the Longest Mean Lifetime When the Guarantee Times are the Same

ABSTRACT

Consider k(≥ 2) independent exponential populations Π₁, Π₂, …, Π _k , having the common unknown location parameter μ ∈ (?∞, ∞) (also called the guarantee time) and unknown scale parameters σ₁, σ₂, …σ _k , respectively (also called the remaining mean lifetimes after the completion of guarantee times), σ _i  > 0, i = 1, 2, …, k. Assume that the correct ordering between σ₁, σ₂, …, σ _k is not known apriori and let σ_[i], i = 1, 2, …, k, denote the ith smallest of σ _j s, so that σ_[1] ≤ σ_[2] ··· ≤ σ_[k]. Then Θ _i  = μ + σ _i is the mean lifetime of Π _i , i = 1, 2, …, k. Let Θ_[1] ≤ Θ_[2] ··· ≤ Θ_[k] denote the ranked values of the Θ _j s, so that Θ_[i] = μ + σ_[i], i = 1, 2, …, k, and let Π_(i) denote the unknown population associated with the ith smallest mean lifetime Θ_[i] = μ + σ_[i], i = 1, 2, …, k. Based on independent random samples from the k populations, we propose a selection procedure for the goal of selecting the population having the longest mean lifetime Θ_[k] (called the “best” population), under the subset selection formulation. Tables for the implementation of the proposed selection procedure are provided. It is established that the proposed subset selection procedure is monotone for a general k (≥ 2). For k = 2, we consider the loss measured by the size of the selected subset and establish that the proposed subset selection procedure is minimax among selection procedures that satisfy a certain probability requirement (called the P*-condition) for the inclusion of the best population in the selected subset.     

A RENEWAL THEOREM IN MULTIDIMENSIONAL TIME

Let Y_l, Y₂,… be i.i.d., positive, integer-valued random variables with means, μ. Let the sequences {Y_ij, j= 1,2,…}, i= 1,…, r be independent copies of {Y₁, Y₂,…}. For n={n₁,…, n_r.}, n₁≥1, let S_n=S?ⁿ¹_k1=1= 1 …S?^nr_kr=1 Y_ik1… Y_rkr. We show that S?^N_k=1S?^∞_k1=1…S?^∞_nr=1 P[[S_n= k] ? [μ^-r N log^r-1 (N)/(r-1)!] as N →∞.     

More bounds for moments of some rank statistics

Let X₁,…,X₇ be i.i.d. random variables with a common continuous distribution F, Two parameters, μ(F) = P(X₁ < X₅ and X₁+X₄ < X₂+X₃) and λ(F) = P(X₁+X₄ < X₂+X₃ and X₁+X₇ < X₅+X₆), which appear in the moments of some rank statistics have been studied by several authors. It is shown that the existing lower bound, 3/10 ≤ μ(F) can be improved to 3/10 < μ(F) and that no further improvement is possible. It is also shown that the existing upper bounds μ(F) ≤ (2^1/2+6)/24 ≈ 0.30893 and λ(F) ≤ 7/24 ≈ 0.29167 can be improved to [14+(2/3)^1/2]/48 ≈ 0.30868 and {7 ? [1 ? (2/3)^1/2]²/4}/24 ≈ 0.29132.     

Small samples confidencce intervals on common mean of two normal distributions variances

Let X₁,X₂,…,X_m be distributed normally with mean μ and variance σ² _X; Let Y₁,Y₂,…,Y_n be distributed normally with mean μ and variance σ² _Y; let X₁,X₂,…,X_m,Y₁,Y₂,…,Y_n be jointly independent. There have been several papers written concerning point estimation of μ for this problem, but very little is available in the literature concerning confidence intervals on the common mean μ. In this paper a method is proposed that results in a confidence interval with confidence coefficient essentially equal to a prescribed value 1 - α. The method is evaluated and compnred with other methods through the expected length of the confidence interval.     

A zero-one law for large order statistics

Fix r ≥ 1, and let {M_nr} be the rth largest of {X₁,X₂,…X_n}, where X₁,X₂,… is a sequence of i.i.d. random variables with distribution function F. It is proved that P[M_nr ≤ u_n i.o.] = 0 or 1 according as the series Σ^∞_n=3Fⁿ(u_n)(log log n)^r/n converges or diverges, for any real sequence {u_n} such that n{1 -F(u_n)} is nondecreasing and divergent. This generalizes a result of Bamdorff-Nielsen (1961) in the case r = 1.     

A two stage procedure for selecting δ∗-optimal means in the normal model

Suppose π₁,…,π_k are k normal populations with π_i having unknown mean μ_i and unknown variance σ². The population π_i will be called δ^?-optimal (or good) if μ_i is within a specified amountδ? of the largest mean. A two stage procedure is proposed which selects a subset of the k populations and guarantees with probability at least P^? that the selected subset contains only δ?-optimal π_i ’s. In addition to screening out non-good populations the rule guarantees a high proportion of sufficiently good π_i’S will be selected.     

Approximate confidence bounds for ratios of variance components in two-way unbalanced crossed models with interactions

Consider the general unbalanced two-factor crossed components-of-variance model with interaction given by Y_ijk: = μ+A_i: +B_j: + C_ij: +E_ijk: (i = 1,2, … a; j = 1,…,b; k = 1,…,.n_ij:=0) A_i:,B_j:, C_ij: and E_ijk: are independent unobservable random variables. Also A_i:sim; N(0,σ² _A),B_j: ～ N(0,σ² _B), C_ij:～N(0,s² _C:) and E_ijk:～N(0,s² _E:). In this paper approximate confidence bounds are obtained for ρ_A: = ρ² _A/² and ρ_B: = ρ² _B:/ρ² (where σ² = σ² _A:+ σ² _B+σ² _Cσ² _E) for special cases of the above model. The balanced incomplete block model is studied as a special case.