Demon algorithm¶

A microcanonical Monte Carlo method that augments a simulated system with a small energy reservoir whose exchanges enforce fixed total energy and reveal temperature.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4106
Domain group: Natural Sciences
Origin domain: Physics
Subdomain: Statistical Mechanics Computation → Physics

Core Idea¶

Proposed state changes give energy to the demon when they lower system energy and draw from it when they raise energy, accepting only when the reservoir can pay; the demon-energy distribution estimates inverse temperature after equilibration.^[1] An auxiliary nonnegative degree of freedom conserves total energy locally while allowing the physical subsystem to explore nearby energies, turning reservoir exchanges into an acceptance rule. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of statistical mechanics computation. It is the domain-specific identity determined by the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Demon algorithm, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

The Energy Piggy Bank Demon

Imagine a game where tiny pieces keep trying to wiggle into new spots, and a little helper, the demon, holds a piggy bank of energy coins. If a wiggle gives off energy, the demon puts the coins in the bank. If a wiggle needs energy, the demon pays for it, but only if the bank has enough, because the bank can never go below zero. By watching how full the bank usually is, scientists can tell how hot the pieces are.

The Energy-Banking Demon

The demon algorithm is a computer method physicists use to simulate things like magnets or gases. The computer keeps proposing small changes to the system. An imaginary helper called the demon carries a store of energy that can never be negative. If a change lowers the system's energy, the demon takes the leftover energy; if a change raises it, the demon has to supply the energy, and the change only happens if the demon can afford it. That way the total energy of system plus demon never changes. After things settle, the amounts of energy the demon tends to hold reveal the system's temperature.

Energy-Reservoir Sampling

The demon algorithm is a Monte Carlo method from statistical mechanics for simulating a system at fixed total energy. Besides the physical system, it adds one extra degree of freedom, the 'demon,' which holds a nonnegative amount of energy. The algorithm proposes a random change to the system: if the change lowers the system's energy, the demon absorbs the difference; if it raises the energy, the demon pays for it, and the change is accepted only if the demon has enough energy. This keeps the total energy of system plus demon constant while letting the system explore nearby energies. After the simulation has equilibrated, the demon's energy follows a distribution from which you can estimate the inverse temperature of the system.

The Demon algorithm is a Monte Carlo method for sampling a physical system at approximately fixed total energy. An auxiliary, nonnegative degree of freedom, the demon, acts as a small energy reservoir. For each proposed state change, if the system energy decreases by ΔE, the demon's energy increases by ΔE; if the system energy increases, the demon must supply the difference, and the move is accepted only if the demon's energy would remain nonnegative. Total energy of system plus demon is therefore conserved locally, while the system itself is free to explore nearby energies, so reservoir exchanges become the acceptance rule. After equilibration, the demon's energy follows a distribution from which the inverse temperature can be estimated. A complete specification states the system's microstates and energy function, the demon reservoir and any bounds, the proposal distribution, the conservation of total energy, the acceptance rule, equilibration and sampling checks, and the temperature estimator.

Structural Signature¶

Carrier: the typed statistical mechanics computation carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact statistical mechanics computation carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Demon algorithm
Constitutive operation: An auxiliary nonnegative degree of freedom conserves total energy locally while allowing the physical subsystem to explore nearby energies, turning reservoir exchanges into an acceptance rule.
Invariant: the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit
Recognition test: type the carrier, state every parameter and convention in the definition, test that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Demon algorithm, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of statistical mechanics computation. The field contains many questions and methods that do not instantiate Demon algorithm.
It is not its most familiar example. A canonical instance directly demonstrates that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Metropolis algorithm. Metropolis sampling exchanges energy implicitly with a heat bath at fixed temperature; the demon algorithm conserves system-plus-demon energy in a microcanonical construction.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Demon algorithm must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside statistical mechanics computation, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Demon algorithm belongs to statistical mechanics computation and is useful where the analyst can specify the typed statistical mechanics computation carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit. The scope is broad within that domain but bounded by the need for the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit. Conceptual simulation identity only; no experimental thermodynamic or hazardous-system procedure is provided.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact statistical mechanics computation carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Demon algorithm are converted, constrained, or organized by An auxiliary nonnegative degree of freedom conserves total energy locally while allowing the physical subsystem to explore nearby energies, turning reservoir exchanges into an acceptance rule..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Demon algorithm must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Demon algorithm, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Demon algorithm can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact statistical mechanics computation carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Demon algorithm, the structure counts as Demon algorithm exactly when the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Demon algorithm. Demon algorithm compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Demon algorithm. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed statistical mechanics computation carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit, infer recognizing and comparing instances of Demon algorithm, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Demon algorithm must control the decision and an object that resembles Demon algorithm in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of statistical mechanics computation because they reuse the typed statistical mechanics computation carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, An auxiliary nonnegative degree of freedom conserves total energy locally while allowing the physical subsystem to explore nearby energies, turning reservoir exchanges into an acceptance rule., and type the carrier, state every parameter and convention in the definition, test that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Demon algorithm, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit. The example exposes the carrier and directly tests that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed statistical mechanics computation carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is An auxiliary nonnegative degree of freedom conserves total energy locally while allowing the physical subsystem to explore nearby energies, turning reservoir exchanges into an acceptance rule.; the invariant is the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit; and the result supports recognizing and comparing instances of Demon algorithm, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit destroys the classification.

Mapped back: the typed statistical mechanics computation carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets → An auxiliary nonnegative degree of freedom conserves total energy locally while allowing the physical subsystem to explore nearby energies, turning reservoir exchanges into an acceptance rule. → the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit → recognizing and comparing instances of Demon algorithm, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Demon algorithm, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Demon algorithm, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from statistical mechanics computation and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, An auxiliary nonnegative degree of freedom conserves total energy locally while allowing the physical subsystem to explore nearby energies, turning reservoir exchanges into an acceptance rule., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Demon algorithm, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Demon algorithm, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in statistical mechanics computation.

This entry is a kind of Monte Carlo Simulation.

It remains its own entry because its identity is fixed by the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator.

Relationships to Other Abstractions¶

Current abstraction Demon algorithm Domain-specific

Parents (1) — outgoing typed relations

Demon algorithm is a kind of Monte Carlo Simulation Prime

It remains its own entry because its identity is fixed by the system microstates and energy, demon reservoir and bounds, proposal distribution, total-energy conservation, acceptance rule, equilibration and sampling checks and temperature estimator.

Hierarchy paths (3) — routes to 3 parentless roots

Demon algorithm → is a kind of Monte Carlo Simulation → is a kind of Approximation → is a decomposition of Representation → presupposes Abstraction

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Demon algorithm sits in a crowded region of the domain-specific corpus (26^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Stochastic Processes & Markov Dynamics (29 abstractions)

Nearest neighbors

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

Not to Be Confused With¶

Metropolis algorithm. Metropolis sampling exchanges energy implicitly with a heat bath at fixed temperature; the demon algorithm conserves system-plus-demon energy in a microcanonical construction.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Demon algorithm. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Demon algorithm. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Harvey Gould and Jan Tobochnik and Wolfgang Christian, 'An Introduction to Computer Simulation Methods: Applications to Physical Systems', Addison Wesley, 2006.not authoritative registry ↩a ↩b

[2] Creutz, Michael, 'Microcanonical Monte Carlo Simulation', Phys. Rev. Lett, May 1983, doi:10.1103/PhysRevLett.50.1411. registry ↩a ↩b Show verification details

[3] Michael Creutz, 'Microcanonical Monte Carlo Simulation,' Physical Review Letters 50, 1411-1414 (1983). registry ↩ Show verification details