IDEAS home Printed from https://ideas.repec.org/a/bla/scjsta/v38y2011i2p342-358.html
   My bibliography  Save this article

On the Flexibility of Metropolis–Hastings Acceptance Probabilities in Auxiliary Variable Proposal Generation

Author

Listed:
  • GEIR STORVIK

Abstract

No abstract is available for this item.

Suggested Citation

  • Geir Storvik, 2011. "On the Flexibility of Metropolis–Hastings Acceptance Probabilities in Auxiliary Variable Proposal Generation," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 38(2), pages 342-358, June.
    • Handle: RePEc:bla:scjsta:v:38:y:2011:i:2:p:342-358
    DOI: j.1467-9469.2010.00709.x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/j.1467-9469.2010.00709.x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/j.1467-9469.2010.00709.x?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. Hubin, Aliaksandr & Storvik, Geir, 2018. "Mode jumping MCMC for Bayesian variable selection in GLMM," Computational Statistics & Data Analysis, Elsevier, vol. 127(C), pages 281-297.
    2. Martino, Luca & Del Olmo, Victor Pascual & Read, Jesse, 2012. "A multi-point Metropolis scheme with generic weight functions," Statistics & Probability Letters, Elsevier, vol. 82(7), pages 1445-1453.
    3. Takashi Kamihigashi & Hiroyuki Watanabe, 2016. "A Multiple-Try Extension of the Particle Marginal Metropolis-Hastings (PMMH) Algorithm with an Independent Proposal," Discussion Paper Series DP2016-36, Research Institute for Economics & Business Administration, Kobe University.
    4. Xin Luo & Håkon Tjelmeland, 2019. "A multiple-try Metropolis–Hastings algorithm with tailored proposals," Computational Statistics, Springer, vol. 34(3), pages 1109-1133, September.
    5. Luca Martino & Jesse Read, 2013. "On the flexibility of the design of multiple try Metropolis schemes," Computational Statistics, Springer, vol. 28(6), pages 2797-2823, December.

    More about this item

    Statistics

    Access and download statistics

    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:bla:scjsta:v:38:y:2011:i:2:p:342-358. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0303-6898 .

    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.