Revision as of 21:31, 6 September 2004 edit Guanabot (talk \| contribs) 32,249 edits m Guanaco - robot: changing Windows-1252 characters to HTML entities ← Previous edit		Revision as of 15:36, 28 September 2004 edit undo Thesilverbail (talk \| contribs) Extended confirmed users 523 edits Image and caption Next edit →
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]] to generate a sequence of samples from the [[joint distribution]] of two or more variables.

Metropolis–Hastings algorithm: Difference between revisions