Optimal regular graph designs

DOI10.1007/S11222-016-9720-8MaRDI QIDQ1702287zbMATH OpenOpenAlexFDO

Authors Sera Aylin Cakiroglu

Publication date 28 February 2018

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.05287

zbMATH Keywords

\(D\)-optimalityregular graphs\(A\)-optimalityincomplete block designregular graph design

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Statistical block designs (62K10) Combinatorial aspects of block designs (05B05)

Abstract: A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results and, if the number of blocks is large enough, they are A- and D-optimal. We present the results of an exact computer search for the best regular graph designs in large systems for up to 20 points, k<=r<=10 and r(k-1)-(v-1)[r(k-1)/(v-1)]<=9.

Recommendations

• Regular graph designs
• Some \(E\)-optimal regular graph designs
• Some sufficient conditions for the type 1 optimality of block designs
• On the efficiency of regular generalized line graph designs
• Optimal Incomplete Block Designs

Cites work

• scientific article; zbMATH DE number 3126067 (Why is no real title available?)
• scientific article; zbMATH DE number 3169860 (Why is no real title available?)
• scientific article; zbMATH DE number 3692487 (Why is no real title available?)
• scientific article; zbMATH DE number 3772794 (Why is no real title available?)
• scientific article; zbMATH DE number 3550719 (Why is no real title available?)
• scientific article; zbMATH DE number 1043878 (Why is no real title available?)
• scientific article; zbMATH DE number 3453625 (Why is no real title available?)
• scientific article; zbMATH DE number 3205519 (Why is no real title available?)
• Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
• Combinatorics of optimal designs
• Experimental design for gene expression microarrays
• Fast generation of regular graphs and construction of cages
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• Near-Optimal Designs for Dual Channel Microarray Studies
• On the E-optimality of PBIB designs with a small number of blocks
• On the optimality of block designs
• Optimal Incomplete Block Designs
• Optimality of certain asymmetrical experimental designs
• Optimality of some two-associate-class partially balanced incomplete- block designs
• Theory of optimal designs

Cited in

(7)

• Balanced semi-Latin rectangles: properties, existence and constructions for block size two
• Regular graph designs
• Some sufficient conditions for type 1 optimality with applications to regular graph designs
• On the efficiency of regular generalized line graph designs
• Combinatorics of optimal designs
• Optimal incomplete-block designs with low replication: a unified approach using graphs
• Some sufficient conditions for the type 1 optimality of block designs

Describes a project that uses

Uses Software

• GENREG
• DESIGN
• Mathematica

This page was built for publication: Optimal regular graph designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702287)