2015
DOI: 10.1111/anzs.12119
|View full text |Cite
|
Sign up to set email alerts
|

The Use of Treatment Concurrences to Assess Robustness of Binary Block Designs Against the Loss of Whole Blocks

Abstract: SummaryCriteria are proposed for assessing the robustness of a binary block design against the loss of whole blocks, based on summing elements of selected upper non-principal sections of the concurrence matrix, which improve on the minimal concurrence concept that has been used previously and provide new conditions for measuring the robustness status of a design. The robustness properties of two-associate partially balanced designs are considered and it is shown that two categories of group divisible designs a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(15 citation statements)
references
References 30 publications
0
15
0
Order By: Relevance
“…Every design in a Dυ,-0.166667emb,-0.166667emk with υ <2 k has t * = r . See Theorem 1 of Godolphin & Godolphin () for details. Therefore, it is assumed throughout that υ ≥2 k .…”
Section: Preliminariesmentioning
confidence: 99%
See 4 more Smart Citations
“…Every design in a Dυ,-0.166667emb,-0.166667emk with υ <2 k has t * = r . See Theorem 1 of Godolphin & Godolphin () for details. Therefore, it is assumed throughout that υ ≥2 k .…”
Section: Preliminariesmentioning
confidence: 99%
“…By an argument based on the number of pairs of first associates in treatment subsets, Godolphin & Godolphin () established that t * = r for all singular designs, for all semi‐regular designs and for regular designs with λ 1 < λ 2 . The regular designs with λ 1 > λ 2 do not all have optimal block breakdown number.…”
Section: Robustness Properties Of Some Categories and Sub‐classes Of mentioning
confidence: 99%
See 3 more Smart Citations