IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v19y2006i1d10.1007_s10959-006-0002-9.html
   My bibliography  Save this article

First Hitting Time Analysis of the Independence Metropolis Sampler

Author

Listed:
  • Romeo Maciuca

    (University of California)

  • Song-Chun Zhu

    (University of California)

Abstract

In this paper, we study a special case of the Metropolis algorithm, the Independence Metropolis Sampler (IMS), in the finite state space case. The IMS is often used in designing components of more complex Markov Chain Monte Carlo algorithms. We present new results related to the first hitting time of individual states for the IMS. These results are expressed mostly in terms of the eigenvalues of the transition kernel. We derive a simple form formula for the mean first hitting time and we show tight lower and upper bounds on the mean first hitting time with the upper bound being the product of two factors: a “local” factor corresponding to the target state and a “global” factor, common to all the states, which is expressed in terms of the total variation distance between the target and the proposal probabilities. We also briefly discuss properties of the distribution of the first hitting time for the IMS and analyze its variance. We conclude by showing how some non-independence Metropolis–Hastings algorithms can perform better than the IMS and deriving general lower and upper bounds for the mean first hitting times of a Metropolis–Hastings algorithm.

Suggested Citation

  • Romeo Maciuca & Song-Chun Zhu, 2006. "First Hitting Time Analysis of the Independence Metropolis Sampler," Journal of Theoretical Probability, Springer, vol. 19(1), pages 235-261, January.
  • Handle: RePEc:spr:jotpro:v:19:y:2006:i:1:d:10.1007_s10959-006-0002-9
    DOI: 10.1007/s10959-006-0002-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-006-0002-9
    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/s10959-006-0002-9?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. Mira Antonietta, 2002. "Ordering and improving Monte Carlo Markov chains performance," Economics and Quantitative Methods qf0202, Department of Economics, University of Insubria.
    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.

      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:jotpro:v:19:y:2006:i:1:d:10.1007_s10959-006-0002-9. 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.