Skip to main content
Log in

Efficiency of connected binary block designs when a single observation is unavailable

  • Design
  • Published:
Annals of the Institute of Statistical Mathematics Aims and scope Submit manuscript

Abstract

In this paper the problem of finding the design efficiency is considered when a single observation is unavailable in a connected binary block design. The explicit expression of efficiency is found for the resulting design when the original design is a balanced incomplete block design or a group divisible, singular or semiregular or regular with λ1>0, design. The efficiency does not depend on the position of the unavailable observation. For a regular group divisible design with λ1>0, the efficiency depends on the position of the unavailable observation. The bounds, both lower and upper, on the efficiency are given in this situation. The efficiencies of designs resulting from a balanced incomplete block design and a group divisible design are in fact high when a single observation is unavailable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Baksalary, J. K. and Tabis, Z. (1987). Conditions for the robustness of block designs against the unavailability of data, J. Statist. Plann. Inference, 16, 49–54.

    Google Scholar 

  • Bose, R. C. and Shimamoto, T. (1952). Classification and anlaysis of partially balanced incomplete block designs with two associate classes, J. Amer. Statist. Assoc., 47, 151–184.

    Google Scholar 

  • Clatworthy, W. H. (1973). Table of two-associate-class partially balanced designs, Applied Mathematics Series, 63, National Bureau of Standards, Washington D.C.

    Google Scholar 

  • Dey, A. (1986). Theory of Block Designs, Wiley, New York.

    Google Scholar 

  • Ghosh, S. (1982a). Robustness of BIBD against the unavailability of data, J. Statist. Plann. Inference, 6, 29–32.

    Google Scholar 

  • Ghosh, S. (1982b). Information in an observation in robust designs, Comm. Statist. Theory Methods, 11, 1173–1184.

    Google Scholar 

  • Ghosh, S., Rao, S. B. and Singhi, N. M. (1983). On a robustness property of PBIBD, J. Statist. Plann. Inference, 8, 355–363.

    Google Scholar 

  • Kageyama, S. (1990). Robustness of block designs, The Proceedings of R. C. Bose Symposium on Probability, Statistics and Design of Experiments, 425–438, Wiley Eastern, New Delhi.

    Google Scholar 

  • Mukerjee, R. and Kageyama, S. (1990). Robustness of group divisible designs, Comm. Statist. Theory Methods, 19, 3189–3203.

    Google Scholar 

  • Raghavarao, D. (1971). Constructions and Combinatorial Problems in Design of Experiments, Wiley, New York.

    Google Scholar 

  • Whittinghill, D. C.III (1989). Balanced block designs robust against the loss of a single observation, J. Statist. Plann. Inference, 22, 71–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The work of the first author is sponsored by the Air Force Office of Scientific Research under Grant AFOSR-90-0092.

On leave from Indian Statistical Institute, Calcutta, India. The work of the third author was supported by a grant from the CMDS, Indian Institute of Management, Calcutta.

About this article

Cite this article

Ghosh, S., Kageyama, S. & Mukerjee, R. Efficiency of connected binary block designs when a single observation is unavailable. Ann Inst Stat Math 44, 593–603 (1992). https://doi.org/10.1007/BF00050708

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00050708

Key words and phrases

Navigation