University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The Specification of Robust Binary Block Designs Against the Loss of Whole Blocks

The Specification of Robust Binary Block Designs Against the Loss of Whole Blocks

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Design and Analysis of Experiments

A new criterion is suggested for measuring the robustness of a binary block design D against the loss of whole blocks, which is based on the concept of rectangle concurrencies.

This criterion is superior to the notion of minimal concurrence that has been employed previously and it enables improved conditions for classifying the robustness status of D to be derived.

It is shown that several classes of binary block designs, with the positive feature of possessing either partial balance or near balance, are maximally robust; thus expanding a classic result in the literature, known as Ghosh’s theorem, that confines this status to balanced designs.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity