Robustness of BIBD against the unavailability of data

DOI10.1016/0378-3758(82)90053-2zbMath0473.62060OpenAlexW1998615698MaRDI QIDQ1158710

Subir Ghosh

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0378-3758(82)90053-2

zbMATH Keywords

bipartite graphsrobust designsbalanced incomplete block designsunavailable data

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Statistical block designs (62K10)

Related Items

Robustness to the unavailability of data in block designs ⋮ Robustness of Block Designs for Diallel Crosses Against Missing Data ⋮ EFFICIENCY OF PAIR-WISE TREATMENT COMPARISONS IN INCOMPLETE BLOCK EXPERIMENTS SUBJECT TO THE LOSS OF A BLOCK OF OBSERVATIONS ⋮ Multilevel Augmented Pairs Second-Order Response Surface Designs and Their Robustness to Missing Data ⋮ Conditions for the robustness of block designs against the unavailability of data ⋮ Balanced block designs robust against the loss of a single observation ⋮ Robustness to missing observation and optimalities of response surface designs with regular and complex structure ⋮ A note on robustness of D-optimal block designs for two-colour microarray experiments ⋮ Robust assessment of two-treatment higher-order cross-over designs against missing values ⋮ The robustness of resolvable block designs against the loss of whole blocks or replicates ⋮ Some more robust block designs against the unavailability of data ⋮ Designs with blocks of size two and applications to microarray experiments ⋮ Robustness of balanced incomplete block designs to randomly missing observations ⋮ Robustness of variance balanced block designs ⋮ Improved conditions for the robustness of binary block designs against the loss of whole blocks ⋮ Robustness group divisible designs ⋮ The Use of Treatment Concurrences to Assess Robustness of Binary Block Designs Against the Loss of Whole Blocks ⋮ Robustness of some balanced block designs ⋮ The specification of rank reducing observation sets in experimental design ⋮ On a robustness property of PBIBD ⋮ Circuits for robust designs ⋮ On some of Jerzy Baksalary's contributions to the theory of block designs ⋮ Missing observations in Youden square designs

Cites Work

• Unnamed Item
• Unnamed Item
• Robustness of connected balanced block designs
• Resistance of balanced incomplete block designs
• Robustness of balanced incomplete block designs
• Parallel concepts in graph theory
• Resistant and susceptible BIB designs
• On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs