Pseudo-perfect and adaptive variants of the MetropolisHastings algorithm with an independent candidate density

ISSN： 0094-9655

Source： Journal of Statistical Computation and Simulation, Vol.75, Iss.6, 2005-06, pp. : 459-475

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On directional Metropolis–Hastings algorithms

By Eidsvik Jo Tjelmeland HåKon

Statistics and Computing, Vol. 16, Iss. 1, 2006-03 ,pp. : 93-106

Springer Publishing Company

Access to resources Recommend Favorite

Multiplicative random walk Metropolis-Hastings on the real line

By Dutta Somak

Sankhya B, Vol. 74, Iss. 2, 2012-11 ,pp. : 315-342

Springer Publishing Company

Access to resources Recommend Favorite

Understanding the Hastings Algorithm

By Minh David D. L. Minh Do Le (Paul)

Communications in Statistics: Simulation and Computation, Vol. 44, Iss. 2, 2015-02 ,pp. : 332-349

Taylor & Francis Ltd

Access to resources Recommend Favorite

Acceleration of the Multiple-Try Metropolis algorithm using antithetic and stratified sampling

By Craiu Radu Lemieux Christiane

Statistics and Computing, Vol. 17, Iss. 2, 2007-06 ,pp. : 109-120

Springer Publishing Company

Access to resources Recommend Favorite

A generalization of the adaptive rejection sampling algorithm

By Martino Luca

Statistics and Computing, Vol. 21, Iss. 4, 2011-10 ,pp. : 633-647

Springer Publishing Company

Access to resources Recommend Favorite