IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v30y2024i3p281-297n1006.html
   My bibliography  Save this article

Optimal oversampling ratio in two-step simulation

Author

Listed:
  • Naidu Srinath R.

    (Department of Computer Science & Information Systems, Birla Institute of Technology and Science, Pilani, India)

  • Venkiteswaran Gopalakrishnan

    (Department of Computer Science & Information Systems, Birla Institute of Technology and Science, Pilani, India)

Abstract

This paper analyses a novel two-step Monte Carlo simulation algorithm to estimate the weighted volume of a polytope of the form A ⁢ z ≤ T {Az\leq T} . The essential idea is to partition the columns of A into two categories – a lightweight category and a heavyweight category. Simulation is done in a two-step manner where, for every sample of the lightweight category variables we use multiple samples of the heavyweight category variables. Thus, the heavyweight category variables are oversampled with respect to the lightweight category variables and increasing samples of the heavyweight variables at the expense of the lightweight variables will lead to a more efficient Monte Carlo method. In this paper we present a fast heuristic approximate for estimating the optimal oversampling ratio and substantiate with experimental results which confirm the effectiveness of the method.

Suggested Citation

  • Naidu Srinath R. & Venkiteswaran Gopalakrishnan, 2024. "Optimal oversampling ratio in two-step simulation," Monte Carlo Methods and Applications, De Gruyter, vol. 30(3), pages 281-297.
    • Handle: RePEc:bpj:mcmeap:v:30:y:2024:i:3:p:281-297:n:1006
    DOI: 10.1515/mcma-2024-2011
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2024-2011
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.1515/mcma-2024-2011?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.

    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:bpj:mcmeap:v:30:y:2024:i:3:p:281-297:n:1006. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.