IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-04107-5_31.html
   My bibliography  Save this book chapter

On Array-RQMC for Markov Chains: Mapping Alternatives and Convergence Rates

In: Monte Carlo and Quasi-Monte Carlo Methods 2008

Author

Listed:
  • Pierre L’Ecuyer

    (Université de Montréal, Département d’Informatique et de Recherche Opérationnelle)

  • Christian Lécot

  • Adam L’Archevêque-Gaudet

Abstract

We study the convergence behavior of a randomized quasi-Monte Carlo (RQMC) method for the simulation of discrete-time Markov chains, known as array-RQMC. The goal is to estimate the expectation of a smooth function of the sample path of the chain. The method simulates n copies of the chain in parallel, using highly uniform point sets randomized independently at each step. The copies are sorted after each step, according to some multidimensional order, for the purpose of assigning the RQMC points to the chains. In this paper, we provide some insight on why the method works, explain what would need to be done to bound its convergence rate, discuss and compare different ways of realizing the sort and assignment, and report empirical experiments on the convergence rate of the variance and of the mean square discrepancy between the empirical and theoretical distribution of the states, as a function of n, for various types of discrepancies.

Suggested Citation

  • Pierre L’Ecuyer & Christian Lécot & Adam L’Archevêque-Gaudet, 2009. "On Array-RQMC for Markov Chains: Mapping Alternatives and Convergence Rates," Springer Books, in: Pierre L' Ecuyer & Art B. Owen (ed.), Monte Carlo and Quasi-Monte Carlo Methods 2008, pages 485-500, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-04107-5_31
    DOI: 10.1007/978-3-642-04107-5_31
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-3-642-04107-5_31. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.