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
Long-time Dynamics of Many-body Open Quantum Systems using Quantum Generating Functions
Katha Ganguly, Dario Poletti, Bijay Kumar Agarwalla
Localization Delocalization Transition in Diffusion with Adaptive Resetting
Tommer D. Keidar, Shlomi Reuveni
Quenched activity induces nonuniversal scaling in nonreciprocal XY Models and surfaces
Sudip Mukherjee, Abhik Basu
Brownian yet non-Gaussian diffusion through equilibrium nonlinear friction
Jakob Mihatsch, Andreas M. Menzel
When dissipative steady states admit thermodynamic occupation laws
Tetsu Ichitsubo
Fluctuation--response relations from an emergent Z2 symmetry in the rotating stochastic Landau model
Dhruv Kush, Nicki Mullins, Mauricio Hippert et al.