IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v28y2022i3p221-233n3.html
   My bibliography  Save this article

Approximate bounding of mixing time for multiple-step Gibbs samplers

Author

Listed:
  • Spade David

    (University of Wisconsin–Milwaukee, Milwaukee, WI, USA)

Abstract

Markov chain Monte Carlo (MCMC) methods are important in a variety of statistical applications that require sampling from intractable probability distributions. Among the most common MCMC algorithms is the Gibbs sampler. When an MCMC algorithm is used, it is important to have an idea of how long it takes for the chain to become “close” to its stationary distribution. In many cases, there is high autocorrelation in the output of the chain, so the output needs to be thinned so that an approximate random sample from the desired probability distribution can be obtained by taking a state of the chain every h steps in a process called h-thinning. This manuscript extends the work of [D. A. Spade, Estimating drift and minorization coefficients for Gibbs sampling algorithms, Monte Carlo Methods Appl. 27 2021, 3, 195–209] by presenting a computational approach to obtaining an approximate upper bound on the mixing time of the h-thinned Gibbs sampler.

Suggested Citation

  • Spade David, 2022. "Approximate bounding of mixing time for multiple-step Gibbs samplers," Monte Carlo Methods and Applications, De Gruyter, vol. 28(3), pages 221-233, September.
    • Handle: RePEc:bpj:mcmeap:v:28:y:2022:i:3:p:221-233:n:3
    DOI: 10.1515/mcma-2022-2119
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2022-2119
    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-2022-2119?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:28:y:2022:i:3:p:221-233:n:3. 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.