A Restricted Subset Selection Rule for Selecting at Least One of the t Best Normal Populations in Terms of Their Means When Their Common Variance is Known,Case II

Consider k( ? 2) normal populations with unknown means μ₁, …, μ_k, and a common known variance σ². Let μ_[1] ? ??? ? μ_[k] denote the ordered μ_i.The populations associated with the t(1 ? t ? k ? 1) largest means are called the t best populations. Hsu and Panchapakesan (2004) proposed and investigated a procedure R_HPfor selecting a non empty subset of the k populations whose size is at most m(1 ? m ? k ? t) so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whenever μ_{[k ? t + 1]} ? μ_{[k ? t]} ? δ*, where P*?and?δ* are specified in advance of the experiment. This probability requirement is known as the indifference-zone probability requirement. In the present article, we investigate the same procedure R_HP for the same goal as before but when k ? t < m ? k ? 1 so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whatever be the configuration of the unknown μ_i. The probability requirement in this latter case is termed the subset selection probability requirement. Santner (1976) proposed and investigated a different procedure (R_S) based on samples of size n from each of the populations, considering both cases, 1 ? m ? k ? t and k ? t < m ? k. The special case of t = 1 was earlier studied by Gupta and Santner (1973) and Hsu and Panchapakesan (2002) for their respective procedures.     

Data depth‐based nonparametric scale tests

Liu and Singh (1993, 2006) introduced a depth‐based d‐variate extension of the nonparametric two sample scale test of Siegel and Tukey (1960). Liu and Singh (2006) generalized this depth‐based test for scale homogeneity of k ≥ 2 multivariate populations. Motivated by the work of Gastwirth (1965), we propose k sample percentile modifications of Liu and Singh's proposals. The test statistic is shown to be asymptotically normal when k = 2, and compares favorably with Liu and Singh (2006) if the underlying distributions are either symmetric with light tails or asymmetric. In the case of skewed distributions considered in this paper the power of the proposed tests can attain twice the power of the Liu‐Singh test for d ≥ 1. Finally, in the k‐sample case, it is shown that the asymptotic distribution of the proposed percentile modified Kruskal‐Wallis type test is χ² with k ? 1 degrees of freedom. Power properties of this k‐sample test are similar to those for the proposed two sample one. The Canadian Journal of Statistics 39: 356–369; 2011 © 2011 Statistical Society of Canada     

Partitioning k multivariate normal populations according to equivalence with respect to a standard vector

We propose optimal procedures to achieve the goal of partitioning k multivariate normal populations into two disjoint subsets with respect to a given standard vector. Definition of good or bad multivariate normal populations is given according to their Mahalanobis distances to a known standard vector as being small or large. Partitioning k multivariate normal populations is reduced to partitioning k non-central Chi-square or non-central F distributions with respect to the corresponding non-centrality parameters depending on whether the covariance matrices are known or unknown. The minimum required sample size for each population is determined to ensure that the probability of correct decision attains a certain level. An example is given to illustrate our procedures.     

Optimal Designs for Approximating a Stochastic Process with Respect to a Minimax Criterion

We study the problem of approximating a stochastic process Y = {Y(t: t ∈ T} with known and continuous covariance function R on the basis of finitely many observations Y(t ₁,), …, Y(t _n ). Dependent on the knowledge about the mean function, we use different approximations ? and measure their performance by the corresponding maximum mean squared error sub _t∈T E(Y(t) ? ?(t))². For a compact T ? ? ^p we prove sufficient conditions for the existence of optimal designs. For the class of covariance functions on T ² = [0, 1]² which satisfy generalized Sacks/Ylvisaker regularity conditions of order zero or are of product type, we construct sequences of designs for which the proposed approximations perform asymptotically optimal.     

Combined Bayesian estimates for the equicorrelation coefficient

Combined Bayesian estimates for equicorrelation covariance matrices are considered. The case of a common equicorrelation p and possibly different standard deviations σ_l,σ_k among k experimental groups is examined first, and the Bayesian estimation of (σ, σ₁,σ_k) is discussed. Secondly, under the assumption of a common standard deviation and possibly different equicorrelations, the Bayesian estimation of (ρ₁,ρ_k,σ) is considered.     

Precedence tests and Lehmann alternatives

G = F ^k (k > 1); G = 1 − (1−F) ^k (k < 1); G = F ^k (k < 1); and G = 1 − (1−F) ^k (k > 1), where F and G are two continuous cumulative distribution functions. If an optimal precedence test (one with the maximal power) is determined for one of these four classes, the optimal tests for the other classes of alternatives can be derived. Application of this is given using the results of Lin and Sukhatme (1992) who derived the best precedence test for testing the null hypothesis that the lifetimes of two types of items on test have the same distibution. The test has maximum power for fixed κ in the class of alternatives G = 1 − (1−F) ^k , with k < 1. Best precedence tests for the other three classes of Lehmann-type alternatives are derived using their results. Finally, a comparison of precedence tests with Wilcoxon's two-sample test is presented. Received: February 22, 1999; revised version: June 7, 2000     

Some locally optimal subset selection rules for comparison with a control

Let π₀,π₁,…,π_k be k+1 independent populations. For i=0,1,…,k,π_i has the densit f(x,θ_i), where the (unknown) parameter θ_i belongs to an interval of the real line. Our goal is to select from π₁,… π_k (experimental treatments) those populations, if any, that are better (suitably defined) than π₀ which is the control population. A locally optimal rule is derived in the class of rules for which Pr(π_i is selected)γ_i, i=1,…,k, when θ₀=θ₁=?=θ_k. The criterion used for local optimality amounts to maximizing the efficiency in a certain sense of the rule in picking out the superior populations for specific configurations of θ=(θ₀,…,θ_k) in a neighborhood of an equiparameter configuration. The general result is then applied to the following special cases: (a) normal means comparison — common known variance, (b) normal means comparison — common unknown variance, (c) gamma scale parameters comparison — known (unequal) shape parameters, and (d) comparison of regression slopes. In all these cases, the rule is obtained based on samples of unequal sizes.     

Sequence-compound estimation in scale-exponential families and speed of convergence

This paper deals with a sequence-compound estimation. The component problem is the squared error loss estimation of θ?[a,b] based on an observation X whose p.d.f. is of the form $\text{u(x)c(θ)}\text{exp}\text{(?}\text{x}\text{θ}\text{)}$. For each $\text{0<t<}\text{1}\text{2}$ a class of sequence-compound estimators $\text{ψ}\text{?}\text{=}\text{ψ}\text{?}{}_1\text{,}\text{ψ}\text{?}{}_2\text{,…)}$ is exhibited whose compound risk (average of risks) up to stage n differs from the Bayes envelope (in the component problem) w.r.t. the empiric distribution G_n of the parameters involved up to stage n by a quantity of order O(n^?δt) for a δ>0. It is also shown that at any stage i the difference of the risk of ψ?_i and the risk of the Bayes response w.r.t. G_i?1 is O(i^?δt). Examples of the above type of families are given where δ is min{1,$\text{2a}\text{b}$} and t is arbitrarily close to $\text{1}\text{2}$. Here it may be worthwhile to mention that a rate $\text{O}\text{(n}{}^{\mathrm{<mtext>?</mtext><mtext>1</mtext><mtext>2</mtext>}}\text{)}$ or better has not yet been obtained even in a very special family of densities.     

Probabilities and moments of generalized discrete distributfons using finite difference operators

The probabilities and factorial moments of the univar iate and multivariate generalized (or compound) discrete di st r-Lbut Lons with probability generating functions H(t)=F(G(t)) and H(t₁,…,t_k)=F(G(t₁,…,t_k))or H(t₁,…,t_k) = F(G₁(t₁),…, G_k( t_k)) are derived using finite difference operators.     

Empirical Bayes regression analysis with many regressors but fewer observations

In this paper, we consider the prediction problem in multiple linear regression model in which the number of predictor variables, p, is extremely large compared to the number of available observations, n  . The least-squares predictor based on a generalized inverse is not efficient. We propose six empirical Bayes estimators of the regression parameters. Three of them are shown to have uniformly lower prediction error than the least-squares predictors when the vector of regressor variables are assumed to be random with mean vector zero and the covariance matrix (1/n)X^tX$(1/n){\mathit{X}}^{\mathrm{t}}\mathit{X}$ where X^t=(_x1,…,_xn)${\mathit{X}}^{\mathrm{t}}=({\mathit{x}}_1,\dots ,{\mathit{x}}_n)$ is the p×n$p\times n$ matrix of observations on the regressor vector centered from their sample means. For other estimators, we use simulation to show its superiority over the least-squares predictor.     

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.     

Some multivariate singular unified skew-normal distributions and their application

Abstract

We introduce here the truncated version of the unified skew-normal (SUN) distributions. By considering a special truncations for both univariate and multivariate cases, we derive the joint distribution of consecutive order statistics X_{(r, ..., r + k)} = (X_(r), ..., X_{(r + K)})^T from an exchangeable n-dimensional normal random vector X. Further we show that the conditional distributions of X_{(r + j, ..., r + k)} given X_{(r, ..., r + j ? 1)}, X_{(r, ..., r + k)} given (X_(r) > t)?and X_{(r, ..., r + k)} given (X_{(r + k)} < t) are special types of singular SUN distributions. We use these results to determine some measures in the reliability theory such as the mean past life (MPL) function and mean residual life (MRL) function.     

A probablistic analysis for an optimal screening problem

Summary We consider a lotL formed byN apparently similar unitsW ₁,…,W _N, where each of theW _i may come from one of two different populationsP ₁ andP ₂;T ₁,…,T _N denote the corresponding lifetimes. The units fromP _i undergo a failure of kindi and their survival function isS _i (t). We assume that the failure rate function are known and that the units fromP ₁ are ?substandard?: λ ₁ (t)≥λ ₂ (t), ∀t≥0. We want to putW ₁,…,W _N under a pre-operational test (burn-in test) in order to eliminate at least a great part of the substandard units and we face the problem of obtaining a rule for stopping the test under the assumption that, with the failure of a unit, it is possible to recognize the population from which the unit comes. Such a problem will be formalized as an optimal stopping problem for a suitably defined Markov process. Our study shall evidentiate some fundamental aspects of the problem and the role of the prior distribution of the (random) numberM ₀ of those units inL coming fromP ₁ (substandard). The latter distribution has a great influence on the form of the solution. This research was supported by the C.N.R. Project ?Statistica Bayesiana e Simulazione in Affidalità e Modellistica Biologica?.     

Testing stability in a spatial unilateral autoregressive model

ABSTRACT

Least squares estimator of the stability parameter ? ? |α| + |β| for a spatial unilateral autoregressive process X_{k, ?} = αX_{k ? 1, ?} + βX_{k, ? ? 1} + ?_{k, ?} is investigated and asymptotic normality with a scaling factor n^5/4 is shown in the unstable case ? = 1. The result is in contrast to the unit root case of the AR(p) model X_k = α₁X_{k ? 1} + ??? + α_pX_{k ? p} + ?_k, where the limiting distribution of the least squares estimator of the unit root parameter ? ? α₁ + ??? + α_p is not normal.     

Distributions of patterns of two successes separated by a string of <Emphasis Type="Italic">k</Emphasis>-2 failures

Let Z ₁, Z ₂, . . . be a sequence of independent Bernoulli trials with constant success and failure probabilities p = Pr(Z _t  = 1) and q = Pr(Z _t  = 0) = 1 − p, respectively, t = 1, 2, . . . . For any given integer k ≥ 2 we consider the patterns E₁{\mathcal{E}_{1}}: two successes are separated by at most k−2 failures, E₂{\mathcal{E}_{2}}: two successes are separated by exactly k −2 failures, and E₃{\mathcal{E}_{3}} : two successes are separated by at least k − 2 failures. Denote by N_n,k⁽ⁱ⁾{ N_{n,k}^{(i)}} (respectively M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}) the number of occurrences of the pattern E_i{\mathcal{E}_{i}} , i = 1, 2, 3, in Z ₁, Z ₂, . . . , Z _n when the non-overlapping (respectively overlapping) counting scheme for runs and patterns is employed. Also, let T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} (resp. W_r,k⁽ⁱ⁾){W_{r,k}^{(i)})} be the waiting time for the r − th occurrence of the pattern E_i{\mathcal{E}_{i}}, i = 1, 2, 3, in Z ₁, Z ₂, . . . according to the non-overlapping (resp. overlapping) counting scheme. In this article we conduct a systematic study of N_n,k⁽ⁱ⁾{N_{n,k}^{(i)}}, M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}, T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} and W_r,k⁽ⁱ⁾{W_{r,k}^{(i)}} (i = 1, 2, 3) obtaining exact formulae, explicit or recursive, for their probability generating functions, probability mass functions and moments. An application is given.     

Rank-order tests for the parallelism of several regression surfaces

For testing the hypothesis that several (s?2) linear regression surfaces X_ki=α_k+β_kc_ki+Z_ki (k=1,…,s) are parallel to one another, i.e., β₁=?=β_s, a class of rank-order tests are considered. The tests are shown to be asymptotically distribution-free, and their asymptotic efficiency relative to the general likelihood ratio test is derived. Asymptotic optimality in the sense of Wald is also discussed.     

Empirical bayes rules for selecting good populations

A problem of selecting populations better than a control is considered. When the populations are uniformly distributed, empirical Bayes rules are derived for a linear loss function for both the known control parameter and the unknown control parameter cases. When the priors are assumed to have bounded supports, empirical Bayes rules for selecting good populations are derived for distributions with truncation parameters (i.e. the form of the pdf is f(x|θ)= p_i(x)c_i(θ)I_{(0, θ)}(x)). Monte Carlo studies are carried out which determine the minimum sample sizes needed to make the relative errors less than ε for given ε-values.     

SELECTING "DEMONSTRABLY BEST" OR "DEMONSTRABLY WORST" EXPONENTIAL POPULATIONS

Consider k independent observations Y_i (i= 1,., k) from two-parameter exponential populations _i with location parameters μ and the same scale parameter If the μ_i are ranked as consider population as the “worst” population and II_p(k) as the “best” population (with some tagging so that p{) and p(k) are well defined in the case of equalities). If the Y_i are ranked as we consider the procedure, “Select provided Y_R(k) Y_r(k) is sufficiently large so that is demonstrably better than the other populations.” A similar procedure is studied for selecting the “demonstrably worst” population.