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

DOI10.1016/J.JSPI.2015.02.006zbMATH Open1321.62099OpenAlexW2041192398MaRDI QIDQ496474FDOQ496474

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

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

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)

Cites Work

• On the theory of connected designs: Characterization and optimality
• α_n–Designs
• Augmented p-rep designs
• Title not available (Why is that?)
• On the independence number of a graph in terms of order and size
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimality of some two-associate-class partially balanced incomplete- block designs
• Title not available (Why is that?)
• Resolvable designs with large blocks
• Improved conditions for the robustness of binary block designs against the loss of whole blocks
• A new class of resolvable incomplete block designs
• Title not available (Why is that?)
• Minimum breakdown designs in blocks of size two
• 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
• Some more robust block designs against the unavailability of data
• Constructions of resolvable group divisible designs and related designs
• A note on robustness of D-optimal block designs for two-colour microarray experiments
• Simple Pilot Procedures for the Avoidance of Disconnected Experimental Designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Construction and optimality of affine-resolvable designs
• On the application of affine resolvable designs to variety trials

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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)