Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,366,107 papers from all fields of science
Search
Sign In
Create Free Account
Metropolis–Hastings algorithm
Known as:
Metropolis method
, Metropolis sampling
, Metropolis-Hastings algorithm
Expand
In statistics and in statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
32 relations
Autocorrelation
Blackboard system
Computing the permanent
Detailed balance
Expand
Broader (1)
Markov chain Monte Carlo
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Accelerating Metropolis-Hastings algorithms: Delayed acceptance with prefetching
Marco Banterle
,
Clara Grazian
,
C. Robert
2014
Corpus ID: 88519654
MCMC algorithms such as Metropolis-Hastings algorithms are slowed down by the computation of complex target distributions as…
Expand
2009
2009
On a Directionally Adjusted Metropolis-Hastings Algorithm
D. Fraser
2009
Corpus ID: 14639592
We propose a new Metropolis-Hastings algorithm for sampling from smooth, unimodal distributions; a restriction to the method is…
Expand
2008
2008
The Linked Importance Sampler Auxiliary Variable Metropolis Hastings Algorithm for Distributions with Intractable Normalising Constants
J. Koskinen
2008
Corpus ID: 54709739
We consider parameter inference for the class of models where the likelihoodfunction is analytically intractable as a result of a…
Expand
2008
2008
Building Heterogeneous Peer-to-Peer Networks: Protocol and Analysis
K. Kwong
,
D. Tsang
IEEE/ACM Transactions on Networking
2008
Corpus ID: 16860830
In this paper, we propose a simple protocol for building heterogeneous unstructured peer-to-peer (P2P) networks. The protocol…
Expand
2005
2005
Accept – reject Metropolis – Hastings sampling and marginal likelihood estimation
John M. Olin
2005
Corpus ID: 32606348
We describe a method for estimating the marginal likelihood, based on CHIB (1995) and CHIB and JELIAZKOV (2001), when simulation…
Expand
Highly Cited
2002
Highly Cited
2002
Likelihood methods for fitting multilevel models with complex level-1 variation
W. Browne
,
D. Draper
,
J. Rasbash
,
H. Goldstein
2002
Corpus ID: 14830071
2001
2001
A novel parallel-rotation algorithm for atomistic Monte Carlo simulation of dense polymer systems
S. Santos
,
U. Suter
,
M. Müller
,
J. Nievergelt
2001
Corpus ID: 58927800
We develop and test a new elementary Monte Carlo move for use in the off-lattice simulation of polymer systems. This novel…
Expand
1999
1999
MCMC and EM-based methods for inference in heavy-tailed processes with /spl alpha/-stable innovations
S. Godsill
Proceedings of the IEEE Signal Processing…
1999
Corpus ID: 17497061
In this paper we present both stochastic and deterministic iterative methods for inference about random processes with symmetric…
Expand
1998
1998
A Sequential Metropolis-hastings Algorithm
P. Vandekerkhove
1998
Corpus ID: 18799130
This paper deals with the asymptotic properties of the Metropolis-Hastings algorithm, when the distribution of interest is…
Expand
1998
1998
Solving Scheduling Problems by Simulated Annealing
O. Catoni
1998
Corpus ID: 121095240
We define a general methodology to deal with a large family of scheduling problems. We consider the case where some of the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE