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

DOI10.1016/j.jspi.2015.02.006zbMath1321.62099OpenAlexW2041192398MaRDI QIDQ496474

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)

Related Items

Type-V intermittency from Markov binary block visibility graph perspective ⋮ Type-II intermittency from Markov binary block visibility graph perspective ⋮ Type-I intermittency from Markov binary block visibility graph perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Augmented p-rep designs
• Minimum breakdown designs in blocks of size two
• Resolvable designs with large blocks
• The specification of rank reducing observation sets in experimental design
• Conditions for the robustness of block designs against the unavailability of data
• Robustness of BIBD against the unavailability of data
• Optimality of some two-associate-class partially balanced incomplete- block designs
• Some more robust block designs against the unavailability of data
• On the theory of connected designs: Characterization and optimality
• Constructions of resolvable group divisible designs and related designs
• Improved conditions for the robustness of binary block designs against the loss of whole blocks
• A note on robustness of D-optimal block designs for two-colour microarray experiments
• Simple Pilot Procedures for the Avoidance of Disconnected Experimental Designs
• A new class of resolvable incomplete block designs
• α_n–Designs
• Construction and optimality of affine-resolvable designs
• On the independence number of a graph in terms of order and size