IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v27y2021i3p195-209n2.html
   My bibliography  Save this article

Estimating drift and minorization coefficients for Gibbs sampling algorithms

Author

Listed:
  • Spade David A.

    (Department of Mathematical Sciences, University of Wisconsin–Milwaukee, 3200 N. Cramer Street Milwaukee, Wisconsin53211, USA)

Abstract

Gibbs samplers are common Markov chain Monte Carlo (MCMC) algorithms that are used to sample from intractable probability distributions when sampling directly from full conditional distributions is possible. These types of MCMC algorithms come up frequently in many applications, and because of their popularity it is important to have a sense of how long it takes for the Gibbs sampler to become close to its stationary distribution. To this end, it is common to rely on the values of drift and minorization coefficients to bound the mixing time of the Gibbs sampler. This manuscript provides a computational method for estimating these coefficients. Herein, we detail the several advantages of the proposed methods, as well as the limitations of this approach. These limitations are primarily related to the “curse of dimensionality”, which for these methods is caused by necessary increases in the numbers of initial states from which chains need be run and the need for an exponentially increasing number of grid points for estimation of minorization coefficients.

Suggested Citation

  • Spade David A., 2021. "Estimating drift and minorization coefficients for Gibbs sampling algorithms," Monte Carlo Methods and Applications, De Gruyter, vol. 27(3), pages 195-209, September.
    • Handle: RePEc:bpj:mcmeap:v:27:y:2021:i:3:p:195-209:n:2
    DOI: 10.1515/mcma-2021-2093
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2021-2093
    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-2021-2093?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:27:y:2021:i:3:p:195-209:n:2. 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.