IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v24y2022i3d10.1007_s11009-021-09909-y.html
   My bibliography  Save this article

Convergence Rates of Attractive-Repulsive MCMC Algorithms

Author

Listed:
  • Yu Hang Jiang

    (University of Toronto)

  • Tong Liu

    (University of Toronto)

  • Zhiya Lou

    (University of Toronto)

  • Jeffrey S. Rosenthal

    (University of Toronto)

  • Shanshan Shangguan

    (University of Toronto)

  • Fei Wang

    (University of Toronto)

  • Zixuan Wu

    (University of Toronto)

Abstract

We consider MCMC algorithms for certain particle systems which include both attractive and repulsive forces, making their convergence analysis challenging. We prove that a version of these algorithms on a bounded state space is uniformly ergodic with explicit quantitative convergence rate. We also prove that a version on an unbounded state space is still geometrically ergodic, and then use the method of shift-coupling to obtain an explicit quantitative bound on its convergence rate.

Suggested Citation

  • Yu Hang Jiang & Tong Liu & Zhiya Lou & Jeffrey S. Rosenthal & Shanshan Shangguan & Fei Wang & Zixuan Wu, 2022. "Convergence Rates of Attractive-Repulsive MCMC Algorithms," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 2029-2054, September.
    • Handle: RePEc:spr:metcap:v:24:y:2022:i:3:d:10.1007_s11009-021-09909-y
    DOI: 10.1007/s11009-021-09909-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-021-09909-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-021-09909-y?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.

    References listed on IDEAS

    as
    1. Matthews, Peter, 1993. "A slowly mixing Markov chain with implications for Gibbs sampling," Statistics & Probability Letters, Elsevier, vol. 17(3), pages 231-236, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lahiri, Kajal & Gao, Jian, 2002. "Bayesian analysis of nested logit model by Markov chain Monte Carlo," Journal of Econometrics, Elsevier, vol. 111(1), pages 103-133, November.
    2. Justel, Ana & Peña, Daniel, 1995. "Gibbs sampling will fail in outlier problems with strong masking," DES - Working Papers. Statistics and Econometrics. WS 4203, Universidad Carlos III de Madrid. Departamento de Estadística.

    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:metcap:v:24:y:2022:i:3:d:10.1007_s11009-021-09909-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.