Cluster Monte Carlo algorithms
Werner Krauth
Abstract
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable algorithmic freedom given by the detailed balance condition. Cluster algorithms appear, among other systems, in classical spin models, such as the Ising model, in lattice quantum models (bosons, quantum spins and related systems) and in hard spheres and other `entropic' systems for which the configurational energy is either zero or infinite. In this chapter, we discuss the basic idea of cluster algorithms with special emphasis on the pivot cluster method for hard spheres and related systems, for which several recent applications are presented.We provide less technical detail but more context than in the original papers.
Create a lesson
Related papers
Typical number and stability of equilibria in large non-reciprocal complex systems
Bertrand Lacroix-A-Chez-Toine, Pierre Le Doussal, Valentina Ros
Thermodynamic geometry of three coupled Ising spins: exact curvature, frustration and bond anisotropy
Zahra Ebadi, Nayyere Einali Saghavaz, Omid Yahyayi Monem et al.
Galois conjugation, droplet growth, and the differential transcendence of the Ising model in nonzero field
Ran Luo, Jiahua Tian
Masked diffusion as random sequential adsorption: an exactly solvable model for parallel decoding
Adrian Baule
Emergent Symmetry in Constant-Density Flocks
Hugues Chaté, Alexandre Solon
Solvable macroscopic models for populations of type I excitability neurons with Gaussian noise
Maria V. Ageeva, Denis S. Goldobin