Metropolis–Hastings algorithm: Difference between revisions

Content deleted Content added
math tags apparently don't work in image captions
m rm Physics cat, just a tool only
Line 1:
[[Image:Metropolis_hastings_algorithm.png|thumb|350px|The Sampling [[probability distribution | distribution]] ''Q'' determines the next point to move to in the [[random walk]].]]
In [[mathematics]] and [[physics]], the '''Metropolis-Hastings algorithm''' is an [[algorithm]] used to generate a sequence of samples from the [[joint distribution]] of two or more variables.
In [[mathematics]] and [[physics]],
the '''Metropolis-Hastings algorithm''' is an [[algorithm]] to generate a sequence of samples from the [[joint distribution]] of two or more variables.
The purpose of such a sequence is to approximate the joint distribution (as with a histogram), or to compute an integral (such as an expected value).
This algorithm is an example of a [[Markov chain Monte Carlo]] algorithm.
Line 70 ⟶ 69:
[[Category:Algorithms]]
[[Category:Probability and statistics]]
[[Category:Physics]]
[[Category:Sampling techniques]]