Rejection-free cluster Wang-Landau algorithm for hard-core lattice gases

Abstract

We introduce a rejection-free, flat histogram, cluster algorithm to determine the density of states of hard-core lattice gases. We show that the algorithm is able to efficiently sample low entropy states that are usually difficult to access, even when the excluded volume per particle is large. The algorithm is based on simultaneously evaporating all the particles in a strip and reoccupying these sites with a new appropriately chosen configuration. We implement the algorithm for the particular case of the hard-core lattice gas in which the first k next-nearest neighbors of a particle are excluded from being occupied. It is shown that the algorithm is able to reproduce the known results for k = 1,2,3 both on the square and cubic lattices. We also show that, in comparison, the corresponding flat histogram algorithms with either local moves or unbiased cluster moves are less accurate and do not converge as the system size increases.

19 Pages, 25 figures

References in corpus (11)

• Wang-Landau Algorithm: a Theoretical Analysis of the Saturation of the Error
• Monte Carlo simulations of 2d hard core lattice gases
• Extracting the equation of state of lattice gases from Random Sequential Adsorption simulations by means of the Gibbs adsorption isotherm
• The isotropic-nematic transition for hard rods on a three--dimensional (3D) cubic lattice
• Phase diagram of a system of hard cubes on the cubic lattice
• Direct measurements of the dynamical correlation length indicate its divergence at an athermal glass transition
• Phase transitions in systems of hard rectangles with non-integer aspect ratio
• Husimi lattice solutions and the coherent-anomaly-method analysis for hard-square lattice gases
• Intrinsic convergence properties of entropic sampling algorithms
• Three stable phases and thermodynamic anomaly in a binary mixture of hard particles
• Fluid-fluid demixing and density anomaly in a ternary mixture of hard spheres