利用图寻找最佳区组设计
Using graphs to find the best block designs
摘要:
设计实验的统计学家希望从收集的数据中获取尽可能多的信息。这通常意味着未知参数的最精确估计(即具有最小可能方差的估计)。如果有多个参数,这可以用多种方式解释:我们希望最小化参数的平均方差,还是最大方差,还是置信区域的体积?在区组设计的情况下,这些最优性准则可以从设计的并发图计算,在许多情况下可以从其拉普拉斯特征值计算。也可以使用Levi图。各种标准原来是密切相关的其他性质的图作为一个网络,如数量的生成树,等周数,和总和的电阻对顶点之间的图被视为一个电网络。在这一章中,我们讨论了不完全区组设计的最优性概念,解释了图论的联系,并证明了一些关于最优性的新老结果。
英文摘要:
A statistician designing an experiment wants to get as much information as possible from the data gathered. Often this means the most precise estimate possible (that is, an estimate with minimum possible variance) of the unknown parameters. If there are several parameters, this can be interpreted in many ways: do we want to minimize the average variance, or the maximum variance, or the volume of a confidence region for the parameters? In the case of block designs, these optimality criteria can be calculated from the concurrence graph of the design, and in many cases from its Laplacian eigenvalues. The Levi graph can also be used. The various criteria turn out to be closely connected with other properties of the graph as a network, such as number of spanning trees, isoperimetric number, and the sum of the resistances between pairs of vertices when the graph is regarded as an electrical network. In this chapter, we discuss the notions of optimality for incomplete-block designs, explain the graph-theoretic connections, and prove some old and new results about optimality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。