Minimum breakdown designs in blocks of size two

In scientific investigations, there are many situations where each two experimental units have to be grouped into a block of size two. For planning such experiments, the variance-based optimality criteria like A-, D- and E-criterion are typically employed to choose efficient designs, if the estimation efficiency of treatment contrasts is primarily concerned. Alternatively, if there are observations which tend to become lost during the experimental period, the robustness criteria against the unavailability of data should be strongly recommended for selecting the planning scheme. In this study, a new criterion, called minimum breakdown criterion, is proposed to quantify the robustness of designs in blocks of size two. Based on the proposed criterion, a new class of robust designs, called minimum breakdown designs, is defined. When various numbers of blocks are missing, the minimum breakdown designs provide the highest probabilities that all the treatment contrasts are estimable. An exhaustive search procedure is proposed to generate such designs. In addition, two classes of uniformly minimum breakdown designs are theoretically verified.     

Robustness of a Class of Partial Diallel Cross Designs to the Unavailability of a Complete Block of Observations

Complete and partial diallel cross designs are examined as to their construction and robustness against the loss of a block of observations. A simple generalized inverse is found for the information matrix of the line effects, which allows evaluation of expressions for the variances of the line-effect differences with and without the missing block. A-efficiencies, based on average variances of the elementary contrasts of the line-effects, suggest that these designs are fairly robust. The loss of efficiency is generally less than 10%, but it is shown that specific comparisons might suffer a loss of efficiency of as much as 40%.     

The Use of Treatment Concurrences to Assess Robustness of Binary Block Designs Against the Loss of Whole Blocks

Criteria are proposed for assessing the robustness of a binary block design against the loss of whole blocks, based on summing entries of selected upper non‐principal sections of the concurrence matrix. These criteria improve on the minimal concurrence concept that has been used previously and provide new conditions for measuring the robustness status of a design. The robustness properties of two‐associate partially balanced designs are considered and it is shown that two categories of group divisible designs are maximally robust. These results expand a classic result in the literature, obtained by Ghosh, which established maximal robustness for the class of balanced block designs.     

A note on robustness of D-optimal block designs for two-colour microarray experiments

Two-colour microarray experiments form an important tool in gene expression analysis. Due to the high risk of missing observations in microarray experiments, it is fundamental to concentrate not only on optimal designs but also on designs which are robust against missing observations. As an extension of Latif et al. (2009), we define the optimal breakdown number for a collection of designs to describe the robustness, and we calculate the breakdown number for various D-optimal block designs. We show that, for certain values of the numbers of treatments and arrays, the designs which are D-optimal have the highest breakdown number. Our calculations use methods from graph theory.     

Robustness of subset response surface designs to missing observations

Experiments designed to investigate the effect of several factors on a process have wide application in modern industrial and scientific research. Response surface designs allow the researcher to model the effects of the input variables on the response of the process. Missing observations can make the results of a response surface experiment quite misleading, especially in the case of one-off experiments or high cost experiments. Designs robust to missing observations can attract the user since they are comparatively more reliable. Subset designs are studied for their robustness to missing observations in different experimental regions. The robustness of subset designs is also improved for multiple levels by using the minimax loss criterion.     

Existence of nested designs with block size five

The block designs considered here are nested in the unified sense of Preece (Biometrika 54 (1967) 479–486) and Federer (in: T.A. Baneroft (Ed.), Statistical Papers in Honor of George W. Snedecor, 1972, pp. 91–114), that is, each block of the larger balanced incomplete block design contains several distinguished families of mutually disjoint sub-blocks, the sub-blocks of the same family belonging to the same system, such that each system forms the collection of blocks of some balanced incomplete block design. In this paper, it is shown that the necessary conditions for the existence of such designs are also sufficient for block size 5 and sub-block sizes 2 and 3. This, together with known results, implies the entire existence of such designs with block size 5 in general.     

A-optimal diallel crosses for test versus control comparisons

A-optimality of block designs for control versus test comparisons in diallel crosses is investigated. A sufficient condition for designs to be A-optimal is derived. Type S₀ designs are defined and A-optimal type S₀ designs are characterized. A lower bound to the A-efficiency of type S₀ designs is also given. Using the lower bound to A-efficiency, type S₀ designs are shown to yield efficient designs for test versus control comparisons.     

Robustness of complete diallel crossing plans against exchange of one cross

The robustness aspects of block designs for complete diallel crossing plans against the exchange of one cross using connectedness and efficiency criteria have been investigated. The exchanged cross may have either no line in common or one line in common with the original cross. It has been found that randomized complete block (RCB) designs for complete diallel crosses and binary balanced block designs for complete diallel crosses are robust against the exchange of one cross in one observation. The RCB designs for diallel crosses have been shown to be robust against the exchange of one cross with another cross in all the blocks. The non-binary balanced block designs obtainable from Family 5 of Das et al. (1998) have also been found to be robust against the exchange of one cross.     

A note on A-efficiency of connected designs

Khatri (1982) justified a statement “Among the variance balanced designs, one should choose the design which has the minimum number of plots”, in terms of A-efficiency. Examples of connected block designs are here presented to disprove Khatri's statement. Some general results are also provided to stress our statements.     

Robustness of some designs against missing data

This article studies the robustness of several types of designs against missing data. The robustness of orthogonal resolution III fractional factorial designs and second-order rotatable designs is studied when a single observation is missing. We also study the robustness of balanced incomplete block designs when a block is missing and of Youden square designs when a column is missing.     

Robustness group divisible designs

Robustness of group divisible (GD) designs is investigated, when one block is lost, in terms of efficiency of the residual design. The exact evaluation of the efficiency can be made for singular GD and semi-regular GD designs as ell as regular GD designs with λ₁ = 0. In a regular GD design with λ₁ > 0, the efficiency may depend upon the lost block and sharp upper and lower bounds on the efficiency are presented. The investigation shows that GD designs are fairly robust in terms of efficiency. As a special case, we can also show the robustness of balanced incomplete block design when one block is lost.     

Missing values in replicated Latin squares

Designs based on any number of replicated Latin squares are examined for their robustness against the loss of up to three observations randomly scattered throughout the design. The information matrix for the treatment effects is used to evaluate the average variances of the treatment differences for each design in terms of the number of missing values and the size of the design. The resulting average variances are used to assess the overall robustness of the designs. In general, there are 16 different situations for the case of three missing values when there are at least three Latin square replicates in the design. Algebraic expressions may be determined for all possible configurations, but here the best and worst cases are given in detail. Numerical illustrations are provided for the average variances, relative efficiencies, minimum and maximum variances and the frequency counts, showing the effects of the missing values for a range of design sizes and levels of replication.     

The robustness of chain block designs and coat-of-mail designs

Chain block designs are relatively vulnerable to loss of information when missing values or outliers may occur. An alternative class of designs, coat-of-mail designs, are proposed and the relative robustness of the two types of design are compared.     

Equi-information robust designs: Which designs are possible?

The effects of missing observations in a designed experiment are reviewed. Conditions are determined for a design to retain equal information, i.e. the same generalized variance of unknown parameters, when either any single or any pair of observations is lost. Some examples of designs with this property are given. Although there are many designs which retain equal information for the loss of exactly t observations, where t = 1,2,3,…, it is shown that it is not possible to obtain any design which retains equal information when any one and any two and also any three observations are missing.     

Optimal and efficient treatment control design in the heteroscedastic one-way layout with covariates

In this article, we take up the experimental situation of a heteroscedastic one-way layout model in the presence of a set of controllable covariates. For the joint estimation of the elementary contrasts of a set of test treatments with a control and the effects of covariates, sufficient conditions for the existence of an A-optimal design are identified. When these sufficient conditions are not met, we propose highly A-efficient designs. The methods of construction of A-optimal and highly A-efficient designs are discussed. For different values of the parameters of the design, A-efficiency of the proposed designs are tabulated for a comparative study.     

PARTIALLY EQUINEIGHBOURED DESIGNS

This paper presents further results on a class of designs called equineighboured designs, ED. These designs are intended for field and related experiments, especially whenever there is evidence that observations in the same block are correlated. An ED has the property that every unordered pair of treatments occurs as nearest neighbours equally frequently at each level. Ipinyomi (1986) has defined and shown that ED are balanced designs when neighbouring observations are correlated. He has also presented ED as a continuation of the development of optimal block designs. An ED would often require many times the number of experimental materials needed for the construction of an ordinary balanced incomplete block, BIB, design for the same number of treatments and block sizes. Thus for a relatively large number of treatments and block sizes the required minimum number of blocks may be excessively large for practical use of ED. In this paper we shall define and examine partially equineighboured designs with n concurrences, PED (n), as alternatives where ED are practically unachievable. Particular attention will be given to designs with smaller numbers of blocks and for which only as little balance as possible may be lost.     

Balanced and partially balanced incomplete block designs with autocorrelation errors

The paper aims to find variance balanced and variance partially balanced incomplete block designs when observations within blocks are autocorrelated and we call them BIBAC and PBIBAC designs. Orthogonal arrays of type I and type II when used as BIBAC designs have smaller average variance of elementary contrasts of treatment effects compared to the corresponding Balanced Incomplete Block (BIB) designs with homoscedastic, uncorrelated errors. The relative efficiency of BIB designs compared to BIBAC designs depends on the block size k and the autocorrelation ρ and is independent of the number of treatments. Further this relative efficiency increases with increasing k. Partially balanced incomplete block designs with autocorrelated errors are introduced using partially balanced incomplete block designs and orthogonal arrays of type I and type II.     

Connectedness of complete block designs under an interference model

We consider an experiment with fixed number of blocks, in which a response to a treatment can be affected by treatments from neighboring units. For such experiment the interference model with neighbor effects is studied. Under this model we study connectedness of binary complete block designs. Assuming the circular interference model with left-neighbor effects we give the condition for minimal number of blocks necessary to obtain connected design. For a specified class of binary, complete block designs, we show that all designs are connected. Further we present the sufficient and necessary conditions of connectedness of designs with arbitrary, fixed number of blocks.     

Lower Bounds for the Efficiency of Designs with Respect to the D-Criterion when the Observations are Correlated

In the general linear model consider the experimental design problem for the Gauß-Markov estimator or least squares estimator when the observations are correlated. We prove new formulas for the efficiency of an exact design with respect to the D-criterion. For models with intercept term, for example, these formulas are useful to derive better lower bounds for the efficiency than the bounds recently given for an arbitrary linear model. These bounds are applied in examples to symmetrical regular circulants as covariance matrices. A byproduct of the investigations is some insight as to what kinds of designs might retain their optimality or high efficiency (for the uncorrelated homoscedastic case) under correlated observations.     

Optimal saturated block designs when observations are correlated

A- and MV-optimal block designs are identified in the class of minimally connected designs when the observations within blocks are spatially correlated. All connected designs are shown to be D-equal regardless of the correlation structure, and a sufficient condition for E-optimality is presented. Earlier results for the uncorrelated case are strengthened.