Metraipolis › archive › dc_6e1ddec2afbd

Metropolis–Hastings algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T13:03:50.910Z
SHA-256 of the archived text
294df91f526e5fbb69cc402580c45641dc521c9e8921c52f01e488027b098aff
Stable URL of this page
https://metraipolis.com/documento/dc_6e1ddec2afbd

How to cite

Metropolis–Hastings algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_6e1ddec2afbd (Metraipolis archive dc_6e1ddec2afbd, sha256 294df91f526e5fbb69cc402580c45641dc521c9e8921c52f01e488027b098aff)
BibTeX
@misc{dc6e1ddec2afbd,
  title = {Metropolis–Hastings algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_6e1ddec2afbd; sha256 294df91f526e5fbb69cc402580c45641dc521c9e8921c52f01e488027b098aff},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In statistics and statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult. New samples are added to the sequence in two steps: first a new sample is proposed based on the previous sample, then the proposed sample is either added to the sequence or rejected depending on the value of the probability distribution at that point. The resulting sequence can be used to approximate the distribution (e.g. to generate a histogram) or to compute an integral (e.g. an expected value). Metropolis–Hastings and other MCMC algorithms are generally used for sampling from multi-dimensional distributions, especially when the number of dimensions is high. For single-dimensional distributions, there are usually other methods (e.g. adaptive rejection sampling) that can directly return independent samples from the distribution, and these are free from the problem of autocorrelated samples that is inherent in MCMC methods.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Metropolis–Hastings algorithm» — https://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_algorithm
Wikidata Q910810 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q910810
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1377873950, consultata il 2026-10-07T12:34:33.950Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 2a5dc04be1bd169320bfd97967f05569155299b80fd190f156c26ecd8bdefefb