Files in this item
Optimal incomplete-block designs with low replication : a unified approach using graphs
Item metadata
dc.contributor.author | Bailey, R. A. | |
dc.contributor.author | Sajjad, Alia | |
dc.date.accessioned | 2021-11-09T11:30:05Z | |
dc.date.available | 2021-11-09T11:30:05Z | |
dc.date.issued | 2021-12 | |
dc.identifier | 275870165 | |
dc.identifier | c77730af-1a9e-4975-b2c2-626e7976d0ac | |
dc.identifier | 85118689995 | |
dc.identifier | 000715811900001 | |
dc.identifier.citation | Bailey , R A & Sajjad , A 2021 , ' Optimal incomplete-block designs with low replication : a unified approach using graphs ' , Journal of Statistical Theory and Practice , vol. 15 , no. 4 , 84 . https://doi.org/10.1007/s42519-021-00215-x | en |
dc.identifier.issn | 1559-8608 | |
dc.identifier.other | ORCID: /0000-0002-8990-2099/work/103137826 | |
dc.identifier.uri | https://hdl.handle.net/10023/24297 | |
dc.description.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. | |
dc.format.extent | 28 | |
dc.format.extent | 861706 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Statistical Theory and Practice | en |
dc.subject | Block design | en |
dc.subject | A-optimality | en |
dc.subject | D-optimality | en |
dc.subject | Concurrence graph | en |
dc.subject | Levi graph | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Optimal incomplete-block designs with low replication : a unified approach using graphs | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Statistics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1007/s42519-021-00215-x | |
dc.description.status | Peer reviewed | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.