Method evidence record
Markov Chain Monte Carlo
Markov Chain Monte Carlo (MCMC) is a family of simulation algorithms that constructs a Markov chain whose stationary distribution is the target posterior, enabling Bayesian inference and high-dimensional integral computation that would otherwise be analytically intractable. Pioneered by Metropolis and colleagues in 1953 and extended by Hastings in 1970, MCMC underpins modern Bayesian statistics. The two most widely used variants are Metropolis-Hastings, which proposes moves from a general proposal distribution, and Gibbs sampling, which draws each parameter in turn from its full conditional distribution.
Evidence statusSources recorded, not reviewedBibliographic sources are present. Claim-level evidence review has not been performed.
Source record
Recorded
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
Markov Chain Monte Carlo (MCMC — Metropolis-Hastings, Gibbs Sampling)
Taxonomic method recordprocess-pipelinesimulation
Open full method2 recorded citations, copied from the method source record.
Curated claims
Assessed
Claims persisted in the evidence ledger, each with its own assessment.
No curated claims yet
This view does not invent a claim assessment when the ledger has none.
Related methods
Suggested5
Generated from the method graph and shown as machine-suggested relations. No evidence claim is inferred.
- Same method familyApproximate Bayesian Computation
machine-suggestedRelational suggestion, not evidence.
- See alsoBayesian Regression
machine-suggestedRelational suggestion, not evidence.
- Same method familyBootstrap Simulation
machine-suggestedRelational suggestion, not evidence.
- Same method familyLatin Hypercube Sampling
machine-suggestedRelational suggestion, not evidence.
- See alsoMONTE-CARLO-SIMULATION
machine-suggestedRelational suggestion, not evidence.