Ising Model — Sweeny & Invaded Cluster Algorithms

The Sweeny algorithm updates bonds in the FK (Fortuin-Kasteleyn) random cluster representation, offering critical slowing-down reduction near Tc. The invaded cluster algorithm automatically tunes to criticality by only adding bonds until a spanning cluster forms, making it self-tuning to Tc without knowing the temperature.

Parameters
Algorithm:
Observables
|m|:
Energy E/N:
χ (susc):
Largest cluster:
Algorithm:Sweeny
Sweeps:0