Abstract
AbstractAn 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.
Publisher
Springer Science and Business Media LLC
Subject
Statistics and Probability
Reference36 articles.
1. Bailey RA (2007) Designs for two-colour microarray experiments. Appl Stat 56:356–394
2. Bailey RA (2009) Variance and concurrence in block designs, and distance in the corresponding graphs. Mich Math J 58:105–124
3. Bailey RA, Cameron Peter J (2009) Combinatorics of optimal designs. In: Huczynska S, Mitchell JD, Roney-Dougal CM (eds) Surveys in combinatorics 2009. London Mathematical Society lecture note series, vol 365. Cambridge University Press, Cambridge, pp 19–73
4. Bailey RA, Cameron PJ (2013) Using graphs to find the best block designs. In: Beineke LW, Wilson RJ (eds) Topics in structural graph theory. Cambridge University Press, Cambridge, pp 282–317
5. Bailey RA, Schiffl K, Hilgers R-D (2013) A note on robustness of D-optimal block designs for two-colour microarray experiments. J Stat Plan Inference 143:1195–1202
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献