IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v29y2023i2p161-171n3.html
   My bibliography  Save this article

A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy

Author

Listed:
  • Alsolami Maryam

    (Department of Computer Science, Florida State University, Tallahassee, FL 32306-4530, USA ; and College of Computers and Information Systems, Umm Al-Qura University, Kingdom of Saudi Arabia)

  • Mascagni Michael

    (Department of Computer Science, Florida State University, Tallahassee, FL 32306-4530, ; and National Institute of Standards & Technology, ITL, Gaithersburg, MD 20899-8910, USA)

Abstract

In this paper, we introduce a new algorithm for estimating the lower bounds for the star discrepancy of any arbitrary point sets in [0,1]s[0,1]^{s}. Computing the exact star discrepancy is known to be an NP-hard problem, so we have been looking for effective approximation algorithms. The star discrepancy can be thought of as the maximum of a function called the local discrepancy, and we will develop approximation algorithms to maximize this function. Our algorithm is analogous to the random walk algorithm described in one of our previous papers [M. Alsolami and M. Mascagni, A random walk algorithm to estimate a lower bound of the star discrepancy, Monte Carlo Methods Appl. 28 (2022), 4, 341–348.]. We add a statistical technique to the random walk algorithm by implementing the Metropolis algorithm in random walks on each chosen dimension to accept or reject this movement. We call this Metropolis random walk algorithm. In comparison to all previously known techniques, our new algorithm is superior, especially in high dimensions. Also, it can quickly determine the precise value of the star discrepancy in most of our data sets of various sizes and dimensions, or at least the lower bounds of the star discrepancy.

Suggested Citation

  • Alsolami Maryam & Mascagni Michael, 2023. "A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy," Monte Carlo Methods and Applications, De Gruyter, vol. 29(2), pages 161-171, June.
    • Handle: RePEc:bpj:mcmeap:v:29:y:2023:i:2:p:161-171:n:3
    DOI: 10.1515/mcma-2023-2005
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2023-2005
    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-2023-2005?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:29:y:2023:i:2:p:161-171:n:3. 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.