Markov Chain Monte Carlo
Visualize the Metropolis-Hastings algorithm sampling from complex distributions.
Free theory articleVisualize the Metropolis-Hastings algorithm sampling from complex distributions.
Concept & interpretation
Markov Chain Monte Carlo (MCMC) is a powerful class of algorithms for sampling from complex probability distributions where direct sampling is impossible or computationally intractable. By constructing a Markov chain whose equilibrium distribution matches the desired target distribution, MCMC methods allow us to generate representative samples by simply simulating the chain for a sufficient number of steps.