Some remarks on subdesigns of symmetric designs

Let D(υ, k, λ) be a symmetric design containing a symmetric design D₁(υ₁, k₁, λ₁) (k₁ < k) and let x = υ₁(k ? k₁)/(υ ? υ₁). We show that k ≥(k₁ ? x)² + λ If equality holds, D₁ is called a tight subdesign of D. In the special case, λ₁ = λ, the inequality reduces to that of R.C. Bose and S.S. Shrikhande and tight subdesigns then correspond to their notion of Baer subdesigns. The possibilities for (7upsi;, k, λ) designs having Baer subdesigns are investigated.     

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.     

Information Properties for Concomitants of Order Statistics in Farlie–Gumbel–Morgenstern (FGM) Family

Let (X _i , Y _i ), i = 1, 2,…, n be independent and identically distributed random variables from some continuous bivariate distribution. If X _(r) denotes the rth-order statistic, then the Y's associated with X _(r) denoted by Y _[r] is called the concomitant of the rth-order statistic. In this article, we derive an analytical expression of Shannon entropy for concomitants of order statistics in FGM family. Applying this expression for some well-known distributions of this family, we obtain the exact form of Shannon entropy, some of the information properties, and entropy bounds for concomitants of order statistics. Some comparisons are also made between the entropy of order statistics X _(r) and the entropy of its concomitants Y _[r]. In this family, we show that the mutual information between X _(r) and Y _[r], and Kullback–Leibler distance among the concomitants of order statistics are all distribution-free. Also, we compare the Pearson correlation coefficient between X _(r) and Y _[r] with the mutual information of (X _(r), Y _[r]) for the copula model of FGM family.     

Families of Hadamard group divisible designs

By a family of designs we mean a set of designs whose parameters can be represented as functions of an auxiliary variable t where the design will exist for infinitely many values of t. The best known family is probably the family of finite projective planes with υ = b = t² + t + 1, r = k = t + 1, and λ = 1. In some instances, notably coding theory, the existence of families is essential to provide the degree of precision required which can well vary from one coding problem to another. A natural vehicle for developing binary codes is the class of Hadamard matrices. Bush (1977) introduced the idea of constructing semi-regular designs using Hadamard matrices whereas the present study is concerned mostly with construction of regular designs using Hadamard matrices. While codes constructed from these designs are not optimal in the usual sense, it is possible that they may still have substantial value since, with different values of λ₁ and λ₂, there are different error correcting capabilities.     

Correlation estimation in Downton's bivariate exponential distribution using incomplete samples

Suppose (X, Y) has a Downton's bivariate exponential distribution with correlation ρ. For a random sample of size n from (X, Y), let X _r:n be the rth X-order statistic and Y _[r:n] be its concomitant. We investigate estimators of ρ when all the parameters are unknown and the available data is an incomplete bivariate sample made up of (i) all the Y-values and the ranks of associated X-values, i.e. (i, Y _[i:n]), 1≤i≤n, and (ii) a Type II right-censored bivariate sample consisting of (X _i:n , Y _[i:n]), 1≤i≤r<n. In both setups, we use simulation to examine the bias and mean square errors of several estimators of ρ and obtain their estimated relative efficiencies. The preferred estimator under (i) is a function of the sample correlation of (Y _i:n , Y _[i:n]) values, and under (ii), a method of moments estimator involving the regression function is preferred.     

Generalized Youden designs: construction and tables

Generalized Youden Designs are generalizations of the class of two-way balanced block designs which include Latin squares and Youden squares. They are used for the same purposes and in the same way that these classical designs are used, and satisfy most of the common criteria of design optimality.We explicitly display or give detailed instructions for constructing all these designs within a practical range: when υ, the number of treatments, is ?25; and b₁ and b₂, the dimensions of the design array, are each ?50.     

Weight hierarchies of linear codes of dimension 3

The weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d₁,d₂,…,d_k), where d_r is the smallest support of an r-dimensional subcode of C. The weight hierarchies of [n,3;q] codes are studied. In particular, for q⩽5 the possible weight hierarchies of [n,3;q] codes are determined.     

On an application of concomitants of order statistics

ABSTRACT

Let (X_i, Y_i), i = 1, …, n be a pair where the first coordinate X_i represents the lifetime of a component, and the second coordinate Y_i denotes the utility of the component during its lifetime. Then the random variable Y_{[r: n]} which is known to be the concomitant of the rth order statistic defines the utility of the component which has the rth smallest lifetime. In this paper, we present a dynamic analysis for an n component system under the above-mentioned concomitant setup.     

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.     

Generalized Bhaskar Rao designs of block size three

We show that the necessary conditions

$\text{λ≡0 (}\text{mod}\text{|G|)}$

,

$\text{λ(υ?1)≡0 (}\text{mod}\text{2)}$

,

$\text{λυ(υ?1)≡}\text{0 (}\text{mod}\text{6)}\text{for}\text{|G|}\text{odd}\text{,}\text{0 (}\text{mod}\text{24)}\text{for}\text{|G|}\text{even}$

, are sufficient for the existence of a generalized Bhaskar Rao design GBRD(υ,b,r,3,λ;G) for the elementary abelian group G, of each order |G|.     

Lower percentage points of hartley's extremal quotient statistic and their applications

Consider K(>2) independent populations π₁,..,π _k such that observations obtained from π _k are independent and normally distributed with unknown mean µ _i and unknown variance θ _i i = 1,…,k. In this paper, we provide lower percentage points of Hartley's extremal quotient statistic for testing an interval hypothesisH ₀ θ _[k] θ _[k] > δ vs. H _a : θ _[k] θ _[1] ≤ δ , where δ ≥ 1 is a predetermined constant and θ _[k](θ _[1]) is the max (min) of the θ_i,…,θ _k . The least favorable configuration (LFC) for the test under H ₀ is determined in order to obtain the lower percentage points. These percentage points can also be used to construct an upper confidence bound for θ_[k]/θ_[1].     

A construction of group divisible designs

Given any affine design with parameters v, b, r, k, λ and μ = k²/v and any design with parameters v′, b′, r′, k′, λ′ where r′ = tr for some natural number `t and k′?r, we construct a group divisible design with parameters v′' = vv′, m = v′, n = v, b′' = vb′, k′' = kk′, r′'= kr′, λ₁ = tkλ and λ₂ = μλ′. This is applied to some series of designs. As a lemma, we also show that any 0-1-matrix with row sums tr and column sums ?r may be written as the sum of r 0-1-matrices with row sums t and column sums ?1.     

Robust estimation of the correlation matrix of longitudinal data

We propose a double-robust procedure for modeling the correlation matrix of a longitudinal dataset. It is based on an alternative Cholesky decomposition of the form Σ=DLL ^? D where D is a diagonal matrix proportional to the square roots of the diagonal entries of Σ and L is a unit lower-triangular matrix determining solely the correlation matrix. The first robustness is with respect to model misspecification for the innovation variances in D, and the second is robustness to outliers in the data. The latter is handled using heavy-tailed multivariate t-distributions with unknown degrees of freedom. We develop a Fisher scoring algorithm for computing the maximum likelihood estimator of the parameters when the nonredundant and unconstrained entries of (L,D) are modeled parsimoniously using covariates. We compare our results with those based on the modified Cholesky decomposition of the form LD ² L ^? using simulations and a real dataset.     

On the maxima of heterogeneous gamma variables

In this article, we establish some new results on stochastic comparisons of the maxima of two heterogenous gamma variables with different shape and scale parameters. Let X₁ and X₂ [X*₁ and X*₂] be two independent gamma variables with X_i?[X*_i] having shape parameter r_i?[r*_i] and scale parameter λ_i?[λ*_i], i = 1, 2. It is shown that the likelihood ratio order holds between the maxima, X_{2: 2} and X*_{2: 2} when λ₁ = λ*₁ ? λ₂ = λ*₂ and r₁ ? r*₁ ? r₂ = r*₂. We also prove that, if r_i, r*_i ∈ (0, 1], (r₁, r₂) majorizes (r*₁, r₂*), and (λ₁, λ₂) is p-larger than (λ*₁, λ₂*), then X_{2: 2} is larger than X*_{2: 2} in the sense of the hazard rate order [dispersive order]. Some numerical examples are provided to illustrate the main results. The new results established here strengthen and generalize some of the results known in the literature.     

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.     

Nonparametric statistical procedures for the changepoint problem

Let X₁,…,X_r?1,X_r,X_r+1,…,X_n be independent, continuous random variables such that X_i, i = 1,…,r, has distribution function F(x), and X_i, i = r+1,…,n, has distribution function F(x?Δ), with -∞ <Δ< ∞. When the integer r is unknown, this is refered to as a change point problem with at most one change. The unknown parameter Δ represents the magnitude of the change and r is called the changepoint. In this paper we present a general review discussion of several nonparametric approaches for making inferences about r and Δ.     

Design of experiments in the presence of errors in factor levels

This paper is concerned with the statistical properties of experimental designs where the factor levels cannot be set precisely. When the errors in setting the factor levels cannot be measured, design robustness is explored. However, when the actual design could be measured at the end of the investigation, its optimality is of interest. D-optimality could be assessed in different ways. Several measures are compared. Evaluating them is difficult even in simple cases. Therefore, in general, simulations are used to obtain their values. It is shown that if D-optimality is measured by the expected value of the determinant of the information matrix of the experimental design, as has been suggested in the past, on average the designs appear to improve with the variance of the error in setting the factor levels. However, we argue that the criterion of D-optimality should be based on the inverse of the information matrix. In this case it is shown that the experiment could be better or worse than the planned one. It is also recognized that setting the factor levels with error could lead to an increased risk of losing observations, which on its own could reduce considerably the optimality of the experimental designs. Advice on choosing the design region in such a way that such a risk is controlled to an acceptable level is given.     

Optimal regular graph designs

A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results, and if the number of blocks is large enough, an A-optimal (or D-optimal) design is among them (if any exist). To explore the landscape of designs with a large number of blocks, we introduce extensions of regular graph designs. These are constructed by adding the blocks of a balanced incomplete block design repeatedly to the original design. We present the results of an exact computer search for the best regular graph designs and the best extended regular graph designs with up to 20 treatments v, block size \(k \le 10\) and replication r \(\le 10\) and \(r(k-1)-(v-1)\lfloor r(k-1)/(v-1)\rfloor \le 9\).     

Some determinant optimality aspects of main effect fold-over designs

Saha and Mohanty (1970) presented a main effect fold-over design consisting of 14 treatment combinations of the 24×33 factorial, which had the nice property of being even balanced. Calling this design DSM, this paper establishes the following specific results: (i) DSM is not d-optimal in the subclass Δe of all 14 point even balanced main effect fold-over designs of the 24×33 factorial; (ii) DSM is not d-optimal in the subclass $\text{Δ}{}^1\text{?Δ}{}^{\mathrm{e}}$ of all 14 point even and odd balanced main effect fold-over designs of the 24×33 factorial; (iii) DSM is even optimal in $\text{Δ}{}^1$ and Δe. In addition to these results two 14 point designs in $\text{Δ}{}^1$ are presented which are d-optimal and via a counter example it is shown that these designs are not odd optimal. Finally, several general matrix algebra results are given which should be useful in resolving d-optimality problems of fold-over designs of the kn11×kn22 factorial.     

Rotation designs for experiments in high-bias situations

Many experiments in the physical and engineering sciences study complex processes in which bias due to model inadequacy dominates random error. A noteworthy example of this situation is the use of computer experiments, in which scientists simulate the phenomenon being studied by a computer code. Computer experiments are deterministic: replicate observations from running the code with the same inputs will be identical. Such high-bias settings demand different techniques for design and prediction. This paper will focus on the experimental design problem introducing a new class of designs called rotation designs. Rotation designs are found by taking an orthogonal starting design D and rotating it to obtain a new design matrix D_R=DR, where R is any orthonormal matrix. The new design is still orthogonal for a first-order model. In this paper, we study some of the properties of rotation designs and we present a method to generate rotation designs that have some appealing symmetry properties.