Decomposition tables for experiments I. A chain of randomizations
MetadataShow full item record
One aspect of evaluating the design for an experiment is the discovery of the relationships between subspaces of the data space. Initially we establish the notation and methods for evaluating an experiment with a single randomization. Starting with two structures, or orthogonal decompositions of the data space, we describe how to combine them to form the overall decomposition for a single-randomization experiment that is "structure balanced." The relationships between the two structures are characterized using efficiency factors. The decomposition is encapsulated in a decomposition table. Then, for experiments that involve multiple randomizations forming a chain, we take several structures that pairwise are structure balanced and combine them to establish the form of the orthogonal decomposition for the experiment. In particular, it is proven that the properties of the design for Such an experiment are derived in a straightforward manner from those of the individual designs. We show how to formulate an extended decomposition table giving the sources of variation, their relationships and their degrees of freedom, so that competing designs can be evaluated.
Brien , C J & Bailey , R A 2009 , ' Decomposition tables for experiments I. A chain of randomizations ' Annals of Statistics , vol 37 , no. 6B , pp. 4184-4213 . DOI: 10.1214/09-AOS717
Annals of Statistics
© Institute of Mathematical Statistics, 2009. This is an open access article.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.