Optimal incomplete-block designs with low replication: a unified approach using graphs

R. A.  Bailey; Alia Sajjad

doi:10.1007/s42519-021-00215-x

Optimal incomplete-block designs with low replication: a unified approach using graphs

R. A. Bailey, Alia Sajjad

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

5 Downloads (Pure)

Abstract

An incomplete-block design defines both a concurrence graph and a Levi graph.
Properties of either graph can be used to compare designs with respect to D-optimality and with respect to A-optimality. In this paper we show that optimality of the design implies strong conditions on connectivity properties of the graph, and use this to classify the optimal designs when the number of observational units is close to minimal.

Original language	English
Article number	84
Number of pages	28
Journal	Journal of Statistical Theory and Practice
Volume	15
Issue number	4
Early online date	8 Nov 2021
DOIs	https://doi.org/10.1007/s42519-021-00215-x
Publication status	Published - Dec 2021

Keywords

Block design
A-optimality
D-optimality
Concurrence graph
Levi graph

Access to Document

10.1007/s42519-021-00215-xLicence: CC BY

Bailey-Sajjad2021_Article_OptimalIncomplete-BlockDesigns
Copyright © The Author(s) 2021. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
Final published version, 842 KBLicence: CC BY

Cite this

@article{c77730af1a9e4975b2c2626e7976d0ac,

title = "Optimal incomplete-block designs with low replication: a unified approach using graphs",

abstract = "An incomplete-block design defines both a concurrence graph and a Levi graph.Properties of either graph can be used to compare designs with respect to D-optimality and with respect to A-optimality. In this paper we show that optimality of the design implies strong conditions on connectivity properties of the graph, and use this to classify the optimal designs when the number of observational units is close to minimal.",

keywords = "Block design, A-optimality, D-optimality, Concurrence graph, Levi graph",

author = "Bailey, {R. A.} and Alia Sajjad",

year = "2021",

month = dec,

doi = "10.1007/s42519-021-00215-x",

language = "English",

volume = "15",

journal = "Journal of Statistical Theory and Practice",

issn = "1559-8608",

publisher = "Taylor and Francis",

number = "4",

}

TY - JOUR

T1 - Optimal incomplete-block designs with low replication

T2 - a unified approach using graphs

AU - Bailey, R. A.

AU - Sajjad, Alia

PY - 2021/12

Y1 - 2021/12

N2 - An incomplete-block design defines both a concurrence graph and a Levi graph.Properties of either graph can be used to compare designs with respect to D-optimality and with respect to A-optimality. In this paper we show that optimality of the design implies strong conditions on connectivity properties of the graph, and use this to classify the optimal designs when the number of observational units is close to minimal.

AB - An incomplete-block design defines both a concurrence graph and a Levi graph.Properties of either graph can be used to compare designs with respect to D-optimality and with respect to A-optimality. In this paper we show that optimality of the design implies strong conditions on connectivity properties of the graph, and use this to classify the optimal designs when the number of observational units is close to minimal.

KW - Block design

KW - A-optimality

KW - D-optimality

KW - Concurrence graph

KW - Levi graph

U2 - 10.1007/s42519-021-00215-x

DO - 10.1007/s42519-021-00215-x

M3 - Article

SN - 1559-8608

VL - 15

JO - Journal of Statistical Theory and Practice

JF - Journal of Statistical Theory and Practice

IS - 4

M1 - 84

ER -

Optimal incomplete-block designs with low replication: a unified approach using graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this