Markov chain Monte Carlo
Class of dependent sampling algorithms / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Markov chain Monte Carlo?
Summarize this article for a 10 years old
SHOW ALL QUESTIONS
In statistics, Markov chain Monte Carlo (MCMC) methods comprise a class of algorithms for sampling from a probability distribution. By constructing a Markov chain that has the desired distribution as its equilibrium distribution, one can obtain a sample of the desired distribution by recording states from the chain. The more steps that are included, the more closely the distribution of the sample matches the actual desired distribution. Various algorithms exist for constructing chains, including the Metropolis–Hastings algorithm.
|Part of a series on|
|Posterior = Likelihood × Prior ÷ Evidence|