HomeAlgorithms & AIWang-Landau Density of States

Wang-Landau Density of States

Watch the Wang-Landau flat-histogram algorithm build the density of states g(E) of a 2D Ising spin lattice one random walk at a time — a single run that replaces a separate Monte Carlo simulation at every temperature.

Algorithms & AI3DAdvanced60 FPS📱 Mobile-adapted⇄ 2D version
physics-ext-topic-73 ↗ Open standalone

The Wang-Landau algorithm is a flat-histogram Monte Carlo method that estimates the density of states g(E) of a statistical system in a single random walk — replacing separate Metropolis simulations at every temperature with one run whose output gives the full thermodynamics of the system at any temperature by direct summation. This simulator runs the algorithm live on a 2D Ising spin lattice: a 3D grid of red/blue spins shows the current microstate while an adjoining bar chart builds up ln g(E) in real time, the modification factor ln f halving each time the visit histogram becomes flat enough, exactly as in the original 2001 Wang-Landau paper.

⚙ Under the hood

Watch the Wang-Landau flat-histogram Monte Carlo algorithm build the density of states g(E) of a 2D Ising spin lattice in real time, one random walk that replaces separate simulations at every temperature.

monte carloising modelcomputational physicsstatistical mechanicsdensity of statesalgorithms

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)