OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Metropolis–Hastings algorithm

 Home Mathematics Fields of mathematics Applied mathematics Algorithms Statistical algorithms
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Metropolis–Hastings algorithm is a Markov Chain Monte Carlo (MCMC) method used for sampling from probability distributions that are difficult to sample from directly. It is particularly useful in situations where the distribution is defined up to a normalization constant, making it challenging to derive samples analytically.

 Ancestors (6)

  1. Statistical algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook