The Annals of Statistics

Construction of Optimal Balanced Incomplete Block Designs for Correlated Observations

Ching-Shui Cheng

Full-text: Open access

Abstract

Some methods for the construction of equineighbored balanced incomplete block designs introduced by Kiefer and Wynn (1981) are presented. An algorithm for constructing designs with $k = 3$ is developed. Kiefer and Wynn's result for $k = 3$ is difficult to implement in practice. Our algorithm provides a practical solution and makes use of the decomposition of complete graphs into disjoint Hamiltonian cycles. The construction of designs with $k = v - 1$ and $v - 2$ is also completely solved. The neighbor designs proposed for use in serology are useful for the construction of equineighbored balanced incomplete block designs. Several infinite families of equineighbored balanced incomplete block designs are listed.

Article information

Source
Ann. Statist., Volume 11, Number 1 (1983), 240-246.

Dates
First available in Project Euclid: 12 April 2007

Permanent link to this document
https://projecteuclid.org/euclid.aos/1176346074

Digital Object Identifier
doi:10.1214/aos/1176346074

Mathematical Reviews number (MathSciNet)
MR684881

Zentralblatt MATH identifier
0513.62077

JSTOR
links.jstor.org

Subjects
Primary: 62K10: Block designs
Secondary: 05B05: Block designs [See also 51E05, 62K10]

Keywords
Equineighbored balanced incomplete block designs Hamiltonian cycles neighbor designs

Citation

Cheng, Ching-Shui. Construction of Optimal Balanced Incomplete Block Designs for Correlated Observations. Ann. Statist. 11 (1983), no. 1, 240--246. doi:10.1214/aos/1176346074. https://projecteuclid.org/euclid.aos/1176346074


Export citation