Files in this item
Circular designs balanced for neighbours at distances one and two
Item metadata
dc.contributor.author | Aldred, R. E. L. | |
dc.contributor.author | Bailey, R. A. | |
dc.contributor.author | Mckay, Brendan D. | |
dc.contributor.author | Wanless, Ian M. | |
dc.date.accessioned | 2015-09-12T23:10:53Z | |
dc.date.available | 2015-09-12T23:10:53Z | |
dc.date.issued | 2014-12 | |
dc.identifier | 161200191 | |
dc.identifier | fd66bdba-a094-41c3-ba6e-87ad0ece1e4a | |
dc.identifier | 000345827900013 | |
dc.identifier | 84985940850 | |
dc.identifier | 000345827900013 | |
dc.identifier.citation | Aldred , R E L , Bailey , R A , Mckay , B D & Wanless , I M 2014 , ' Circular designs balanced for neighbours at distances one and two ' , Biometrika , vol. 101 , no. 4 , pp. 943-956 . https://doi.org/10.1093/biomet/asu036 | en |
dc.identifier.issn | 0006-3444 | |
dc.identifier.other | ORCID: /0000-0002-8990-2099/work/39600086 | |
dc.identifier.uri | https://hdl.handle.net/10023/7454 | |
dc.description.abstract | We define three types of neighbour-balanced designs for experiments where the units are arranged in a circle or single line in space or time. The designs are balanced with respect to neighbours at distance one and at distance two. The variants come from allowing or forbidding self-neighbours, and from considering neighbours to be directed or undirected. For two of the variants, we give a method of constructing a design for all values of the number of treatments, except for some small values where it is impossible. In the third case, we give a partial solution that covers all sizes likely to be used in practice. | |
dc.format.extent | 14 | |
dc.format.extent | 311432 | |
dc.language.iso | eng | |
dc.relation.ispartof | Biometrika | en |
dc.subject | Border plot | en |
dc.subject | Circular design | en |
dc.subject | Eulerian trail | en |
dc.subject | Latin square | en |
dc.subject | Neighbour design | en |
dc.subject | Perfect cycle system | en |
dc.subject | Quasigroup | en |
dc.subject | Universal sequence | en |
dc.subject | HA Statistics | en |
dc.subject | QA Mathematics | en |
dc.subject | BDC | en |
dc.subject | R2C | en |
dc.subject.lcc | HA | en |
dc.subject.lcc | QA | en |
dc.title | Circular designs balanced for neighbours at distances one and two | 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 | https://doi.org/10.1093/biomet/asu036 | |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2015-09-12 | |
dc.identifier.url | https://academic.oup.com/biomet/article/101/4/943/1776285#supplementary-data | 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.