Metropolis Algorithm
The Metropolis Algorithm is a Markov chain Monte Carlo method that generates a sequence of samples from a probability distribution by iteratively proposing states and accepting or rejecting them based on an acceptance criterion that ensures convergence to the target distribution.
1.3K
Publications
121.3K
Citations
2.7K
Authors
1.1K
Institutions
Publications per year
2017–2026
284
Parents
1.3K
Monte Carlo sampling methods using Markov chains and their applications
W. Keith Hastings · Biometrika · 1970 · 15.2K citations
Markov Chains for Exploring Posterior Distributions
Luke Tierney · The Annals of Statistics · 1994 · 3.5K citations · Full text
An Adaptive Metropolis Algorithm
Heikki Haario, Eero Saksman, Johanna Tamminen · Bernoulli · 2001 · 2.7K citations
Practical Markov Chain Monte Carlo
Charles J. Geyer · Statistical Science · 1992 · 2.1K citations
Engineering, Mathematics, Statistics +16
1–5 of 1.3K
2.7K
26
h-index
16
h-index
16
h-index
9
h-index
9
h-index
1–5 of 2.7K
1.1K

Centre National de la Recherche Scientifique
Paris, France
25 h-index
68 publications
3.7K citations

University of Warwick
Coventry, United Kingdom
22 h-index
50 publications
3.8K citations

University of Toronto
Toronto, Canada
20 h-index
34 publications
22K citations
University of Cambridge
Cambridge, United Kingdom
20 h-index
38 publications
7.9K citations
Lancaster University
Lancaster, United Kingdom
17 h-index
27 publications
4.2K citations
University of California, Berkeley
Berkeley, United States
17 h-index
46 publications
2.5K citations
Los Alamos National Laboratory
Los Alamos, United States
15 h-index
27 publications
2.3K citations
Harvard University
Cambridge, United States
15 h-index
29 publications
3.2K citations
1–8 of 1.1K
67 publications · 4.8K citations
34
h-index
29 publications · 4.7K citations
26
h-index
JCGS · 29 publications · 3.3K citations
23
h-index
22 publications · 4K citations
21
h-index
Repository · 37 publications · 2.3K citations
17
h-index
1–5