Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorAldred, R. E. L.
dc.contributor.authorBailey, R. A.
dc.contributor.authorMckay, Brendan D.
dc.contributor.authorWanless, Ian M.
dc.date.accessioned2015-09-12T23:10:53Z
dc.date.available2015-09-12T23:10:53Z
dc.date.issued2014-12
dc.identifier.citationAldred , 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/asu036en
dc.identifier.issn0006-3444
dc.identifier.otherPURE: 161200191
dc.identifier.otherPURE UUID: fd66bdba-a094-41c3-ba6e-87ad0ece1e4a
dc.identifier.otherWOS: 000345827900013
dc.identifier.otherScopus: 84985940850
dc.identifier.otherORCID: /0000-0002-8990-2099/work/39600086
dc.identifier.otherWOS: 000345827900013
dc.identifier.urihttp://hdl.handle.net/10023/7454
dc.description.abstractWe 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.extent14
dc.language.isoeng
dc.relation.ispartofBiometrikaen
dc.rightsCopyright 2014. Biometrika Trust. This is a pre-copyedited, author-produced PDF of an article accepted for publication in Biometrika following peer review. The version of record Circular designs balanced for neighbours at distances one and two Aldred, R. E. L., Bailey, R. A., Mckay, B. D. & Wanless, I. M. Dec 2014 In : Biometrika. 101, 4, p. 943-956 is available online at: http://biomet.oxfordjournals.org/content/101/4/943en
dc.subjectBorder ploten
dc.subjectCircular designen
dc.subjectEulerian trailen
dc.subjectLatin squareen
dc.subjectNeighbour designen
dc.subjectPerfect cycle systemen
dc.subjectQuasigroupen
dc.subjectUniversal sequenceen
dc.subjectHA Statisticsen
dc.subjectQA Mathematicsen
dc.subjectBDCen
dc.subjectR2Cen
dc.subject.lccHAen
dc.subject.lccQAen
dc.titleCircular designs balanced for neighbours at distances one and twoen
dc.typeJournal articleen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.Statisticsen
dc.contributor.institutionUniversity of St Andrews.Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1093/biomet/asu036
dc.description.statusPeer revieweden
dc.date.embargoedUntil2015-09-12
dc.identifier.urlhttps://academic.oup.com/biomet/article/101/4/943/1776285#supplementary-dataen


This item appears in the following Collection(s)

Show simple item record