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

Authors

2.7K

  1. GO
    Gareth O. Roberts

    University of Warwick, United Kingdom

    36 publications · 8.3K citations

    26

    h-index

  2. JA
    Jasper A. Vrugt

    University of California, Irvine, United States

    17 publications · 3.4K citations

    16

    h-index

  3. JS
    Jeffrey S. Rosenthal

    University of Toronto, Canada

    18 publications · 4.2K citations

    16

    h-index

  4. WB
    Willem Bouten

    University of Amsterdam, Netherlands

    9 publications · 2.3K citations

    9

    h-index

  5. RM
    Radford M. Neal

    University of Toronto, Canada

    9 publications · 4.3K citations

    9

    h-index

1–5 of 2.7K

Venues

  1. The Journal of Chemical Physics

    67 publications · 4.8K citations

    34

    h-index

  2. Journal of the American Statistical Association

    29 publications · 4.7K citations

    26

    h-index

  3. Journal of Computational and Graphical Statistics

    JCGS · 29 publications · 3.3K citations

    23

    h-index

  4. The Annals of Applied Probability

    22 publications · 4K citations

    21

    h-index

  5. arXiv (Cornell University)

    Repository · 37 publications · 2.3K citations

    17

    h-index

1–5