Cluster Algorithm for hard spheres and related systems
Christophe Dress, Werner Krauth
Abstract
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then superposed, and clusters of overlapping spheres in the joint system are isolated. Each of these clusters can be ``flipped'' independently, a process which generates non-local moves in the original configuration. A generalization of this algorithm (which works perfectly well at small density) can be successfully made to work at densities around the solid-liquid transition point in the two-dimensional hard-sphere system.
Create a lesson
Related papers
Maximum entropy explanation for the ubiquity of power-law mechanical responses
Sverre Holm
Thermodynamic Bethe Ansatz for the Toda chain from inverse scattering transform
Alberto Brollo
Lattice spin systems coupled to a compact U(1) gauge field with negative gauge coupling favoring frustration
Claudio Bonati, Ettore Vicari
The Inverse Mean First-Passage Time Problem
Tommer D. Keidar, Shlomi Reuveni, Igor M. Sokolov
Restricted triangular ice beyond the solvable manifolds: chiral ice and the critical region of dominant chiral vertices
Josep Batle
Establishing Néel order in the square-lattice antiferromagnetic Heisenberg model: a bootstrap proof
Nisarg Chadha, Taige Wang, Pavel A. Nosov et al.