Skip to content

Metropolis Algorithm

In statistics and statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult.

Version
v1 · 2026-09-28 · History
Domain-specific #
10708
Domain group
Natural Sciences
Origin domain
Physics
Subdomains
Statistical Physics, Computational Physics, Markov Chain Monte Carlo → Physics

Core Idea

Metropolis Algorithm is treated here as the recurring Markov-chain Monte Carlo identity summarized by this source-grounded definition: In statistics and statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult. In statistics and statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult.

Scope of Application

  • Description. The method used to propose new candidates is characterized by the probability distribution g(x\mid y) (sometimes written Q(x\mid y) ) of a new proposed sample x given the.

  • Description. For the purpose of illustration, the Metropolis algorithm, a special case of the Metropolis–Hastings algorithm where the proposal function is symmetric, is described below.

  • Description. On the other hand, most simple rejection sampling methods suffer from the "curse of dimensionality", where the probability of rejection increases exponentially as a function of the number of dimensions.

  • Description. As a result, MCMC methods are often the methods of choice for producing samples from hierarchical Bayesian models and other high-dimensional statistical models used nowadays in many disciplines.

  • Description. Various algorithms can be used to choose these individual samples, depending on the exact form of the multivariate distribution: some possibilities are the adaptive rejection sampling methods, the adaptive rejection Metropolis.

Clarity

A clear use of Metropolis Algorithm names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In statistics and statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult.

Manages Complexity

Metropolis Algorithm compresses multiple Markov-chain Monte Carlo details into a stable diagnostic relation. The source shows both the central mechanism—a Markov process is uniquely defined by its transition probabilities P(x' \mid x) , the probability of transitioning from any given state x to any other given state x' .—and the practical consequence—this contradicts an account by Edward Teller, who states in his memoirs that the five authors of.

Abstract Reasoning

  1. Type the carrier. Identify the Markov-chain Monte Carlo entities to which the claim applies.
  2. State the relation. Use the source-grounded identity: In statistics and statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult.
  3. Check operation and conditions.

Knowledge Transfer

Within the home domain. Knowledge about Metropolis Algorithm transfers literally when a new case preserves the same carrier type, relation, and recognition test. The method used to propose new candidates is characterized by the probability distribution g(x\mid y) (sometimes written Q(x\mid y) ) of a new proposed sample x given the previous sample y. For the purpose of illustration, the Metropolis algorithm, a special case of the Metropolis–Hastings algorithm where the proposal function is symmetric, is described below. Beyond the home domain.

Relationships to Other Abstractions

Local relationship map for Metropolis AlgorithmParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Metropolis AlgorithmDOMAINPrime abstraction: Monte Carlo Simulation — is a kind ofMonte CarloSimulationPRIME

Current abstraction Metropolis Algorithm Domain-specific

Parents (1) — more general patterns this builds on

  • Metropolis Algorithm is a kind of Monte Carlo Simulation Prime

    Metropolis Algorithm is a strict kind of Monte Carlo Simulation: In statistics and statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult.

Hierarchy paths (4) — routes to 4 parentless roots

Neighborhood in Abstraction Space

Metropolis Algorithm sits in a moderately populated region (45th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Markov Chains & Probabilistic Computation (6 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08