Metropolis–Hastings algorithm

Summary

Metropolis–Hastings algorithm is an algorithm^[1]. It has Wikipedia articles in 15 language editions, a strong signal of global cultural recognition.^[2]

Key Facts

• Metropolis–Hastings algorithm is credited with the discovery of Nicholas Metropolis^[3].
• Metropolis–Hastings algorithm is credited with the discovery of Marshall Rosenbluth^[4].
• Metropolis–Hastings algorithm is credited with the discovery of Edward Teller^[5].
• Metropolis–Hastings algorithm is credited with the discovery of W. K. Hastings^[6].
• Metropolis–Hastings algorithm is credited with the discovery of Enrico Fermi^[7].
• Metropolis–Hastings algorithm is credited with the discovery of Stanisław Ulam^[8].
• Metropolis–Hastings algorithm's instance of is recorded as algorithm^[9].
• Nicholas Metropolis is named after Metropolis–Hastings algorithm^[10].
• W. K. Hastings is named after Metropolis–Hastings algorithm^[11].
• Metropolis–Hastings algorithm's time of discovery or invention is recorded as 1953^[12].
• Metropolis–Hastings algorithm's facet of is recorded as Markov chain Monte Carlo^[13].
• Metropolis–Hastings algorithm's ACM Classification Code is recorded as 10003679^[14].

Body

Designation and Status

Metropolis–Hastings algorithm's instance of is recorded as algorithm^[9].

History and Context

Things named after include Nicholas Metropolis^[10], a mathematician^[15], 1915–1999^[16], of United States^[17], awarded the Computer Pioneer Award^[18], specialised in physics^[19] and W. K. Hastings^[11], a statistician^[20], 1930–2016^[21], of Canada^[22].

Why It Matters

Metropolis–Hastings algorithm has Wikipedia articles in 15 language editions, a strong signal of global cultural recognition.^[2] It is known by 10 alternative names across languages and contexts.^[23]