Markov chain Monte Carlo

E46140

Monte Carlo method computational algorithm sampling algorithm stochastic simulation method

Markov chain Monte Carlo is a class of algorithms that uses Markov chains to generate samples from complex probability distributions, widely used in Bayesian inference, statistical physics, and machine learning.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (6)

Label	Occurrences
Markov chain Monte Carlo canonical	11
Hamiltonian Monte Carlo	1
Markov chain Monte Carlo methods	1
Metropolis-Hastings algorithm	1
Monte Carlo method	1
random-walk Metropolis	1

How this entity was disambiguated

This entity first appeared as the object of triple T364207 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Markov chain Monte Carlo
Context triple: [Boltzmann machines, hasSamplingMethod, Markov chain Monte Carlo]

A. Bayesian inference
Bayesian inference is a statistical framework that updates the probability of hypotheses as more evidence or data becomes available, using Bayes’ theorem to combine prior beliefs with observed information.
B. Langevin dynamics
Langevin dynamics is a stochastic approach to modeling the motion of particles in a fluid by combining deterministic forces with random thermal fluctuations, often used to simulate Brownian motion and other nonequilibrium processes.
C. Boltzmann machines
Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
D. Euler–Maruyama method
The Euler–Maruyama method is a basic time-stepping scheme for numerically approximating solutions to stochastic differential equations, widely used in simulations of systems with noise such as Langevin dynamics.
E. Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Markov chain Monte Carlo
Target entity description: Markov chain Monte Carlo is a class of algorithms that uses Markov chains to generate samples from complex probability distributions, widely used in Bayesian inference, statistical physics, and machine learning.

A. Bayesian inference
Bayesian inference is a statistical framework that updates the probability of hypotheses as more evidence or data becomes available, using Bayes’ theorem to combine prior beliefs with observed information.
B. Langevin dynamics
Langevin dynamics is a stochastic approach to modeling the motion of particles in a fluid by combining deterministic forces with random thermal fluctuations, often used to simulate Brownian motion and other nonequilibrium processes.
C. Boltzmann machines
Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
D. Euler–Maruyama method
The Euler–Maruyama method is a basic time-stepping scheme for numerically approximating solutions to stochastic differential equations, widely used in simulations of systems with noise such as Langevin dynamics.
E. Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
F. None of above. chosen

Statements (68)

Predicate	Object
instanceOf	Monte Carlo method ⓘ computational algorithm ⓘ sampling algorithm ⓘ stochastic simulation method ⓘ
aimsTo	generate samples from a target probability distribution ⓘ
applicationDomain	Bayesian inference ⓘ computational biology ⓘ econometrics ⓘ graphical models ⓘ machine learning ⓘ spatial statistics ⓘ statistical physics ⓘ
basedOn	Markov property ⓘ linked to: Markov processes Monte Carlo integration ⓘ linked to: Monte Carlo method
canBe	multiple-chain ⓘ single-chain ⓘ
hasChallenge	diagnosing convergence ⓘ multimodal target distributions ⓘ slow mixing in high dimensions ⓘ
hasImprovement	adaptive proposals ⓘ gradient-based proposals ⓘ parallel tempering ⓘ
hasKeyConcept	Markov chain state space ⓘ acceptance probability ⓘ autocorrelation ⓘ burn-in period ⓘ convergence diagnostics ⓘ detailed balance ⓘ ergodicity ⓘ mixing time ⓘ proposal distribution ⓘ stationary distribution ⓘ transition kernel ⓘ
hasMethod	Gibbs sampling ⓘ Hamiltonian Monte Carlo ⓘ Metropolis algorithm ⓘ Metropolis-adjusted Langevin algorithm ⓘ linked to: Langevin dynamics Metropolis–Hastings algorithm ⓘ linked to: Metropolis algorithm adaptive MCMC ⓘ blocked Gibbs sampling ⓘ independence sampler ⓘ random-walk Metropolis ⓘ linked to: Markov chain Monte Carlo reversible jump MCMC ⓘ slice sampling ⓘ
originatedInField	statistical physics ⓘ
property	asymptotically exact under regularity conditions ⓘ produces correlated samples ⓘ requires convergence to stationary distribution ⓘ
relatedTo	importance sampling ⓘ sequential Monte Carlo ⓘ variational inference ⓘ
requires	aperiodic Markov chain ⓘ irreducible Markov chain ⓘ positive recurrent Markov chain ⓘ
typicallyTargets	complex probability distributions ⓘ high-dimensional probability distributions ⓘ
usedFor	Bayesian model comparison ⓘ Boltzmann distribution sampling ⓘ Ising model simulation ⓘ approximating posterior distributions ⓘ estimating integrals ⓘ parameter estimation ⓘ simulating physical systems at equilibrium ⓘ uncertainty quantification ⓘ
uses	Markov chain ⓘ linked to: Markov processes
widelyUsedIn	Bayesian statistics ⓘ deep generative modeling ⓘ probabilistic programming ⓘ

How these facts were elicited