Equation of State Calculations by Fast Computing Machines.¶
Metropolis, N., Rosenbluth, M. N., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of State Calculations by Fast Computing Machines. Journal of Chemical Physics, 21(6), 1087-1092.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Annealing
- The agitation phase is a high "temperature" \(T\): the search proposes random local moves and accepts them with the Metropolis probability \(\min(1, e^{-\Delta E / T})\), so at high \(T\) even large uphill moves (\(\Delta E > 0\)) are accepted freely, dissolving the current structure and letting the tour wander over barriers.
This sourceOrigin of the Metropolis acceptance rule min(1, e^{-ΔE/T}) used as the agitation mechanism in simulated annealing.
- The agitation phase is a high "temperature" \(T\): the search proposes random local moves and accepts them with the Metropolis probability \(\min(1, e^{-\Delta E / T})\), so at high \(T\) even large uphill moves (\(\Delta E > 0\)) are accepted freely, dissolving the current structure and letting the tour wander over barriers.
- Monte Carlo Simulation
- The 1953 paper by Nicholas Metropolis, Arianna and Marshall Rosenbluth, and Augusta and Edward Teller — "Equation of State Calculations by Fast Computing Machines" in the Journal of Chemical Physics — introduced the Metropolis algorithm for sampling from high-dimensional probability distributions
Supported in partVerified against the publisher's abstract
The paper's own abstract confirms a 1953 fast-computing Monte Carlo method for equations of state, but it never names a 'Metropolis algorithm' nor frames the work as sampling high-dimensional probability distributions.
“A general method, suitable for fast computing machines, for investigating such properties as equations of state for substances consisting of interacting individual molecules is described. The method consists of a modified Monte Carlo integration over configuration space. Results for the two-dimensional rigid-sphere system have been obtained on the Los Alamos MANIAC and are presented here.”
- The 1953 paper by Nicholas Metropolis, Arianna and Marshall Rosenbluth, and Augusta and Edward Teller — "Equation of State Calculations by Fast Computing Machines" in the Journal of Chemical Physics — introduced the Metropolis algorithm for sampling from high-dimensional probability distributions
- Random Walk
- The Markov-chain Monte Carlo pattern — "construct a random walk whose stationary distribution is the thing you want to sample, then let it run" — transfers across statistical physics (the Metropolis algorithm for Ising models), Bayesian statistics (posterior sampling), and combinatorial optimization, because all of them face the same structural problem: drawing from a distribution too complex to sample directly, solved by accumulating independent-ish local moves.
Supported in partVerified against the publisher's abstract
The paper gives the Monte Carlo method for interacting-molecule equations of state — the statistical-physics root of MCMC — but says nothing of Bayesian or optimization transfer.
“A general method, suitable for fast computing machines, for investigating such properties as equations of state for substances consisting of interacting individual molecules is described. The method consists of a modified Monte Carlo integration over configuration space.”
- The Markov-chain Monte Carlo pattern — "construct a random walk whose stationary distribution is the thing you want to sample, then let it run" — transfers across statistical physics (the Metropolis algorithm for Ising models), Bayesian statistics (posterior sampling), and combinatorial optimization, because all of them face the same structural problem: drawing from a distribution too complex to sample directly, solved by accumulating independent-ish local moves.
- Simulated Annealing
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 2 of 4 citations: 2 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:603f7ec69834 · see in the full table