Back to the reading lists

    Machine learning foundations· 1953

    Equation of State Calculations by Fast Computing Machines

    Nicholas Metropolis (first author) · 1953

    Read the original

    DOI 10.1063/1.1699114OpenAlex W2056760934

    Propose a particle move.

    On the reading lists

    Why it matters

    Introduced Metropolis sampling, foundational to modern computational Bayesian inference.

    Condensed from the expert lists' notes.

    Inside the paper

    The problem
    Calculating the properties of interacting particles requires averaging over a vast space of configurations. Direct numerical integration is difficult because many possible configurations contribute little to the equilibrium average.
    The idea
    Use a random walk through particle configurations that spends more time in configurations with higher statistical weight. Estimate physical quantities from the configurations visited by the walk.
    How it works
    • Place a finite collection of particles in a square and use periodic copies of the square to reduce boundary effects.
    • Propose a small random displacement for a particle and calculate the resulting change in interaction energy.
    • Accept an energy-lowering move; accept an energy-raising move with a probability that decreases with its energy cost and depends on temperature.
    • Keep the old configuration when a move is rejected and accumulate averages over the resulting sequence of configurations.
    What it showed
    The authors use their method to calculate the equation of state of a two-dimensional rigid-sphere system. They compare the computed pressures with approximations and report agreement between runs with different numbers of particles within statistical error.
    Read it for
    Read Section II for the sampling rule and Section III for its rigid-sphere specialization. Section IV and Figure 4 show the numerical comparison; the detailed virial-coefficient calculation in Section V can be skimmed initially.

    Written in our own words from the paper itself. A draft the editors have not yet reviewed.

    Reading it

    Difficulty: Intermediate

    Read this first: probability; basic statistical physics (optional).

    The record

    First released
    1953 (from OpenAlex)
    Citations
    37,189 citations, as counted by OpenAlex (CC0)
    Named by
    both expert lists
    Score
    0.712 · computed rank 58 · consensus 0.97, must-read 1, citations percentile 0.917 (pre-1970 · foundations), awards 0, existing lists 0. Method

    Editor's notes

    • Readability check: pass: The Metropolis algorithm, from the source; short and readable. (AI draft (Claude), not yet reviewed, 2026-10-29)

    Data sources

    Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.