Cluster algorithm for hard spheres and related systems

DOI10.1088/0305-4470/28/23/001MaRDI QIDQ4345737zbMATH OpenOpenAlexFDO

Authors Christophe Dress, Werner Krauth

Publication date 26 November 1997

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/9612183

zbMATH Keywords

cluster algorithmMonte Carlo algorithmsthermodynamic quantities

Mathematics Subject Classification ID

Other physical applications of random processes (60K40) Statistical mechanics of liquids (82D15)

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.

Recommendations

• scientific article; zbMATH DE number 2159017
• Analysis of an efficient algorithm for the hard-sphere problem
• On a modification of the molecular dynamics method
• About two cluster generating algorithms
• Parallelized event chain algorithm for dense hard sphere and polymer systems

Cited in

(19)

• Dynamical linked cluster expansions: algorithmic aspects and applications
• A new simulation approach to the freezing transition
• Minimal-energy clusters of hard spheres
• Sparse hard-disk packings and local Markov chains
• Brownian dynamics of colloidal hard spheres. III: Extended investigations at the phase transition regime
• On a modification of the molecular dynamics method
• Clustering in interfering binary mixtures
• The Markov chain Monte Carlo revolution
• Analysis of an efficient algorithm for the hard-sphere problem
• CLUSTER METHODS FOR ISING SYSTEMS WITH FIELDS
• scientific article; zbMATH DE number 2159017 (Why is no real title available?)
• Simulation and characterization of random systems of hard particles
• Cluster algorithms for discrete models of colloids with bars
• About two cluster generating algorithms
• Sampling algorithms in statistical physics: a guide for statistics and machine learning
• Cluster Monte Carlo: Extending the range
• Optimal Monte Carlo sampling for simulation of classical fluids
• Parallelized event chain algorithm for dense hard sphere and polymer systems
• Newtonian clustering: an approach based on molecular dynamics and global optimization

This page was built for publication: Cluster algorithm for hard spheres and related systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345737)