IDEAS home Printed from https://ideas.repec.org/a/spr/alstar/v102y2018i4d10.1007_s10182-017-0312-5.html
   My bibliography  Save this article

Optimal designs for treatment comparisons represented by graphs

Author

Listed:
  • Samuel Rosa

    (Comenius University in Bratislava)

Abstract

Consider an experiment for comparing a set of treatments: in each trial, one treatment is chosen and its effect determines the mean response of the trial. We examine the optimal approximate designs for the estimation of a system of treatment contrasts under this model. These designs can be used to provide optimal treatment proportions in more general models with nuisance effects. For any system of pairwise treatment comparisons, we propose to represent such a system by a graph. Then, we represent the designs by the inverses of the vertex weights in the corresponding graph and we show that the values of the eigenvalue-based optimality criteria can be expressed using the Laplacians of the vertex-weighted graphs. We provide a graph theoretic interpretation of D-, A- and E-optimality for estimating sets of pairwise comparisons. We apply the obtained graph representation to provide optimality results for these criteria as well as for ’symmetric’ systems of treatment contrasts.

Suggested Citation

  • Samuel Rosa, 2018. "Optimal designs for treatment comparisons represented by graphs," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 102(4), pages 479-503, October.
    • Handle: RePEc:spr:alstar:v:102:y:2018:i:4:d:10.1007_s10182-017-0312-5
    DOI: 10.1007/s10182-017-0312-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10182-017-0312-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10182-017-0312-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. W. Stallings & J. P. Morgan, 2015. "General weighted optimality of designed experiments," Biometrika, Biometrika Trust, vol. 102(4), pages 925-935.
    2. Samuel Rosa & Radoslav Harman, 2016. "Optimal approximate designs for estimating treatment contrasts resistant to nuisance effects," Statistical Papers, Springer, vol. 57(4), pages 1077-1106, December.
    3. Radoslav Harman, 2004. "Minimal efficiency of designs under the class of orthogonally invariant information criteria," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 60(2), pages 137-153, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Belmiro P. M. Duarte & Anthony C. Atkinson & Satya P. Singh & Marco S. Reis, 2023. "Optimal design of experiments for hypothesis testing on ordered treatments via intersection-union tests," Statistical Papers, Springer, vol. 64(2), pages 587-615, April.
    2. Duarte, Belmiro P.M. & Atkinson, Anthony C. & P. Singh, Satya & S. Reis, Marco, 2023. "Optimal design of experiments for hypothesis testing on ordered treatments via intersection-union tests," LSE Research Online Documents on Economics 115187, London School of Economics and Political Science, LSE Library.
    3. Samuel Rosa, 2019. "Equivalence of weighted and partial optimality of experimental designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 82(6), pages 719-732, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Samuel Rosa, 2019. "Equivalence of weighted and partial optimality of experimental designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 82(6), pages 719-732, August.
    2. Lenka Filová & Mária Trnovská & Radoslav Harman, 2012. "Computing maximin efficient experimental designs using the methods of semidefinite programming," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 75(5), pages 709-719, July.
    3. Harman, Radoslav & Rosa, Samuel, 2019. "Removal of the points that do not support an E-optimal experimental design," Statistics & Probability Letters, Elsevier, vol. 147(C), pages 83-89.
    4. Samuel Rosa & Radoslav Harman, 2016. "Optimal approximate designs for estimating treatment contrasts resistant to nuisance effects," Statistical Papers, Springer, vol. 57(4), pages 1077-1106, December.
    5. Rosa, Samuel & Harman, Radoslav, 2022. "Computing minimum-volume enclosing ellipsoids for large datasets," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    6. Samuel Rosa & Radoslav Harman, 2017. "Optimal approximate designs for comparison with control in dose-escalation studies," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 638-660, September.
    7. García-Ródenas, Ricardo & García-García, José Carlos & López-Fidalgo, Jesús & Martín-Baos, José Ángel & Wong, Weng Kee, 2020. "A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs," Computational Statistics & Data Analysis, Elsevier, vol. 144(C).
    8. Katarína Burclová & Andrej Pázman, 2016. "Optimal design of experiments via linear programming," Statistical Papers, Springer, vol. 57(4), pages 893-910, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:alstar:v:102:y:2018:i:4:d:10.1007_s10182-017-0312-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.