IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v50y2021i19p4510-4527.html
   My bibliography  Save this article

Efficiency balanced designs for bootstrap simulations

Author

Listed:
  • Sudesh K. Srivastav
  • Apurv Srivastav

Abstract

This paper considers the balanced resampling design approach of generating bootstrap samples to handle the simulation error problem in bootstrap estimation of mean and variance of a sample statistic of interest. A class of balanced n-arry block design, slightly different from the definition of Tocher (1952), is defined and its necessary conditions for the existence of these designs are derived. In particular, an infinite series of balanced n-arry block designs are found to be efficiency balanced, i.e., every contrast of element (observation) totals has the same loss of information. As an application in bootstrap method, the eccentric class of efficiency balanced n-arry block design (termed Efficient Bootstrap Sample Design (EBSD(n)) can be used to generate 4n2+1 resamples of sample size n to achieve an exact bootstrap estimation of mean and variance of statistic “sample average”, i.e., a collection of bootstrap data samples and corresponding bootstrap sample averages where mean and variance of this empirical collection of sample averages match the first two theoretical central moments i.e., moments about the sample average. The EBSD(n) solely depends on the existence of balanced incomplete block design B[2n, 4n-2, 2n-1, n, n-1] for n ≥ 2. Thus the implementation of computer algorithm for spawning bootstrap samples using EBSD(n) is simple and straightforward for recapitulating sampling characteristics such as standard error of predefined computable symmetric and non symmetric sample statistic of interest.

Suggested Citation

  • Sudesh K. Srivastav & Apurv Srivastav, 2021. "Efficiency balanced designs for bootstrap simulations," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 50(19), pages 4510-4527, August.
  • Handle: RePEc:taf:lstaxx:v:50:y:2021:i:19:p:4510-4527
    DOI: 10.1080/03610926.2020.1719417
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1719417
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2020.1719417?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:50:y:2021:i:19:p:4510-4527. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.