Optimal regular graph designs
From MaRDI portal
Publication:1702287
DOI10.1007/S11222-016-9720-8zbMATH Open1384.62280arXiv1502.05287OpenAlexW2963860517MaRDI QIDQ1702287FDOQ1702287
Authors: Sera Aylin Cakiroglu 
Publication date: 28 February 2018
Published in: Statistics and Computing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1502.05287
Recommendations
Optimal statistical designs (62K05) Statistical block designs (62K10) Combinatorial aspects of block designs (05B05)
Cites Work
- Title not available (Why is that?)
- Fast generation of regular graphs and construction of cages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimality of some two-associate-class partially balanced incomplete- block designs
- Combinatorics of optimal designs
- Experimental design for gene expression microarrays
- Title not available (Why is that?)
- Optimality of certain asymmetrical experimental designs
- Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
- Theory of optimal designs
- Title not available (Why is that?)
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- On the optimality of block designs
- Near-Optimal Designs for Dual Channel Microarray Studies
- Optimal Incomplete Block Designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the E-optimality of PBIB designs with a small number of blocks
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
Uses Software
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)
