IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v83y2013i9p1956-1962.html
   My bibliography  Save this article

Accelerating reversible Markov chains

Author

Listed:
  • Chen, Ting-Li
  • Hwang, Chii-Ruey

Abstract

Reversibility is usually applied in most popular Markov chain Monte Carlo algorithms, such as the Metropolis–Hastings algorithm and the Gibbs sampler. However, several researchers have shown that non-reversible Markov chains are better than reversible ones. In this paper, we present a method for accelerating a reversible Markov chain. For any reversible Markov chain with a cycle on the corresponding graph, we construct a non-reversible Markov chain by adding some antisymmetric perturbations to the original chain. We prove that this non-reversible Markov chain is uniformly better than the original one in the sense of having a smaller asymptotic variance. Furthermore, we propose a conjecture that no uniformly better chain exists for the acyclic case.

Suggested Citation

  • Chen, Ting-Li & Hwang, Chii-Ruey, 2013. "Accelerating reversible Markov chains," Statistics & Probability Letters, Elsevier, vol. 83(9), pages 1956-1962.
  • Handle: RePEc:eee:stapro:v:83:y:2013:i:9:p:1956-1962
    DOI: 10.1016/j.spl.2013.05.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715213001533
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spl.2013.05.002?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wu, Chi-Hao & Chen, Ting-Li, 2018. "On the asymptotic variance of reversible Markov chain without cycles," Statistics & Probability Letters, Elsevier, vol. 137(C), pages 224-228.
    2. Belmabrouk, Nadia & Damak, Mondher & Yaakoubi, Nejib, 2022. "Dirichlet eigenvalue problems of irreversible Langevin diffusion," Statistics & Probability Letters, Elsevier, vol. 180(C).
    3. Hua, Chen-Wei & Chen, Ting-Li, 2022. "On multiple acceleration of reversible Markov chain," Statistics & Probability Letters, Elsevier, vol. 189(C).
    4. Marie Vialaret & Florian Maire, 2020. "On the Convergence Time of Some Non-Reversible Markov Chain Monte Carlo Methods," Methodology and Computing in Applied Probability, Springer, vol. 22(3), pages 1349-1387, September.
    5. Manal Dakil & Christophe Simon & Taha Boukhobza, 2014. "Reliability and availability analysis of the structural observability of bilinear systems: A graph-theoretical approach," Journal of Risk and Reliability, , vol. 228(3), pages 218-229, June.
    6. Hwang, Chii-Ruey & Normand, Raoul & Wu, Sheng-Jhih, 2015. "Variance reduction for diffusions," Stochastic Processes and their Applications, Elsevier, vol. 125(9), pages 3522-3540.
    7. Shiu, Shang-Ying & Chen, Ting-Li, 2015. "On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound," Statistics & Probability Letters, Elsevier, vol. 105(C), pages 14-19.

    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:eee:stapro:v:83:y:2013:i:9:p:1956-1962. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.