Metropolis–Hastings algorithm

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Metropolis–Hastings algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Jaewook Lee Woosuk Sung Joo-Ho Choi, CC BY 4.0, via Wikimedia Commons.