IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v10y2004i3-4p377-384n19.html
   My bibliography  Save this article

Comparison of Quasi-Monte Carlo-Based Methods for Simulation of Markov Chains

Author

Listed:
  • Lécot Christian

    (Laboratoire de Mathématiques, Université de Savoie, 73376 Le Bourget-du-Lac Cedex, France, E-mail: Christian.Lecot@univ-savoie.fr)

  • Tuffin Bruno

    (IRISA-INRIA Campus universitaire de Beaulieu, 35042 Rennes Cedex, France, E-mail: btuffin@irisa.fr)

Abstract

Monte Carlo (MC) method is probably the most widespread simulation technique due to its ease of use. Quasi-Monte Carlo (QMC) methods have been designed in order to speed up the convergence rate of MC but their implementation requires more stringent assumptions. For instance, the direct QMC simulation of Markov chains is inefficient due to the correlation of the points used. We propose here to survey the QMC-based methods that have been developed to tackle the QMC simulation of Markov chains. Most of those methods were hybrid MC/QMC methods. We compare them with a recently developped pure QMC method and illustrate the better convergence speed of the latter.

Suggested Citation

  • Lécot Christian & Tuffin Bruno, 2004. "Comparison of Quasi-Monte Carlo-Based Methods for Simulation of Markov Chains," Monte Carlo Methods and Applications, De Gruyter, vol. 10(3-4), pages 377-384, December.
  • Handle: RePEc:bpj:mcmeap:v:10:y:2004:i:3-4:p:377-384:n:19
    DOI: 10.1515/mcma.2004.10.3-4.377
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma.2004.10.3-4.377
    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.2004.10.3-4.377?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:10:y:2004:i:3-4:p:377-384:n:19. 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.