The robustness of resolvable block designs against the loss of whole blocks or replicates

DOI10.1016/J.JSPI.2015.02.006MaRDI QIDQ496474zbMATH OpenOpenAlexFDO

Authors J. D. Godolphin, E. J. Godolphin

Publication date 21 September 2015

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL http://epubs.surrey.ac.uk/808761/1/Godolphin-%20revision%20-%20robustness%20of%20resolvable%20designs.pdf

zbMATH Keywords

estimabilityconnectivity\(\alpha_n\)-design\(\alpha\)-designaffine resolvableblock intersectionlattice designmaximal robustnessmost replicate robust

Mathematics Subject Classification ID

Statistical block designs (62K10) Robust parameter designs (62K25)

Recommendations

• scientific article; zbMATH DE number 147183
• scientific article; zbMATH DE number 774837
• Robustness of BIB and extended BIB designs against the unavailability of any number of observations in a block
• scientific article; zbMATH DE number 1046007
• Robustness of some balanced block designs

Cites work

• scientific article; zbMATH DE number 5294801 (Why is no real title available?)
• scientific article; zbMATH DE number 5711161 (Why is no real title available?)
• scientific article; zbMATH DE number 4008394 (Why is no real title available?)
• scientific article; zbMATH DE number 3529295 (Why is no real title available?)
• scientific article; zbMATH DE number 3453625 (Why is no real title available?)
• scientific article; zbMATH DE number 774837 (Why is no real title available?)
• scientific article; zbMATH DE number 847275 (Why is no real title available?)
• scientific article; zbMATH DE number 3097793 (Why is no real title available?)
• A new class of resolvable incomplete block designs
• A note on robustness of D-optimal block designs for two-colour microarray experiments
• Augmented p-rep designs
• Conditions for the robustness of block designs against the unavailability of data
• Construction and optimality of affine-resolvable designs
• Constructions of resolvable group divisible designs and related designs
• Improved conditions for the robustness of binary block designs against the loss of whole blocks
• Minimum breakdown designs in blocks of size two
• On the application of affine resolvable designs to variety trials
• On the independence number of a graph in terms of order and size
• On the theory of connected designs: Characterization and optimality
• Optimality of some two-associate-class partially balanced incomplete- block designs
• Resolvable designs with large blocks
• Robustness of BIBD against the unavailability of data
• Simple Pilot Procedures for the Avoidance of Disconnected Experimental Designs
• Some more robust block designs against the unavailability of data
• The specification of rank reducing observation sets in experimental design
• α_n–Designs

Cited in

(8)

• Designs with blocks of size two and applications to microarray experiments
• Type-I intermittency from Markov binary block visibility graph perspective
• The use of treatment concurrences to assess robustness of binary block designs against the loss of whole blocks
• scientific article; zbMATH DE number 774837 (Why is no real title available?)
• Type-V intermittency from Markov binary block visibility graph perspective
• Type-II intermittency from Markov binary block visibility graph perspective
• Improved conditions for the robustness of binary block designs against the loss of whole blocks
• scientific article; zbMATH DE number 3942832 (Why is no real title available?)

This page was built for publication: The robustness of resolvable block designs against the loss of whole blocks or replicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496474)