The use of treatment concurrences to assess robustness of binary block designs against the loss of whole blocks

DOI10.1111/ANZS.12119zbMATH Open1336.62219OpenAlexW1557348774MaRDI QIDQ2804155FDOQ2804155

E. J. Godolphin, J. D. Godolphin

Publication date: 28 April 2016

Published in: Australian \& New Zealand Journal of Statistics (Search for Journal in Brave)

Full work available at URL: http://epubs.surrey.ac.uk/808760/1/Godolphin%20-%20Revision.pdf

Recommendations

• Improved conditions for the robustness of binary block designs against the loss of whole blocks
• The robustness of resolvable block designs against the loss of whole blocks or replicates
• Conditions for the robustness of block designs against the unavailability of data
• Some more robust block designs against the unavailability of data
• Most robust BIBDs

zbMATH Keywords

concurrenceconnectivitygroup divisible designpartially balanced designmicroarray designblock breakdown numbermaximally robust

Mathematics Subject Classification ID

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

Cites Work

• Efficient design and analysis of two colour factorial microarray experiments
• On the theory of connected designs: Characterization and optimality
• Optimality of some two-associate-class partially balanced incomplete- block designs
• Optimality of certain asymmetrical experimental designs
• New constructions of group divisible designs
• Group divisible designs with block size four and two groups
• Improved conditions for the robustness of binary block designs against the loss of whole blocks
• Minimum breakdown designs in blocks of size two
• 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
• A note on robustness of D-optimal block designs for two-colour microarray experiments
• Simple Pilot Procedures for the Avoidance of Disconnected Experimental Designs
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• Equireplicate balanced block designs with unequal block sizes
• A cyclic method of constructing regular group divisible incomplete block designs
• A method of construction of regular group divisible designs
• Composite construction of group divisible designs
• Some Incomplete Block Designs of Maximum Efficiency
• On a robustness property of PBIBD
• Generalizing Clatworthy group divisible designs
• Some new group divisible designs
• Construction of regular group divisible designs
• Title not available (Why is that?)

Cited In (3)

• Robust assessment of two-treatment higher-order cross-over designs against missing values
• Designs with blocks of size two and applications to microarray experiments
• Some more robust block designs against the unavailability of data

Uses Software

• daMA

This page was built for publication: The use of treatment concurrences to assess robustness of binary block designs against the loss of whole blocks

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