Simulation via Direct Computation of Partition Functions

Abstract

In this paper, we demonstrate the efficiency of simulations via direct computation of the partition function under various macroscopic conditions, such as different temperatures or volumes. The method can compute partition functions by flattening histograms, through the Wang-Landau recursive scheme, outside the energy space. This method offers a more general and flexible framework for handling various types of ensembles, especially the ones in which computation of the density of states is not convenient. It can be easily scaled to large systems, and it is flexible in incorporating Monte Carlo cluster algorithms or molecular dynamics. High efficiency is shown in simulating large Ising models, in finding ground states of simple protein models, and in studying the liquid-vapor phase transition of a simple fluid. The method is very simple to implement and we expect it to be efficient in studying complex systems with rugged energy landscapes, e.g., biological macromolecules.

10 pages, 3 figures, 2 tables; reference added, minor clarifications;

References in corpus (2)

• Multicanonical Study of Coarse-Grained Off-Lattice Models for Folding Heteropolymers
• Convergence and Refinement of the Wang-Landau Algorithm

Cited by in corpus (15)

• Enhanced sampling and applications in protein folding in explicit solvent
• Optimal Modification Factor and Convergence of the Wang-Landau Algorithm
• Improving the efficiency of extended ensemble simulations: The accelerated weight histogram method
• Multicanonical MCMC for Sampling Rare Events
• Enhanced sampling in generalized ensemble with large gap of sampling parameter: case study in temperature space random walk
• Comparing parallel and simulated tempering enhanced sampling algorithms at phase transition regimes
• The effect of polydispersity on the ordering transition of adsorbed self-assembled rigid rods
• The criticality of self-assembled rigid rods on triangular lattices
• Teaching statistical physics by thinking about models and algorithms
• Counting Solutions for the N-queens and Latin Square Problems by Efficient Monte Carlo Simulations
• Phase behavior of the Confined Lebwohl-Lasher Model
• Multicanonical molecular dynamics by variable-temperature thermostats and variable-pressure barostats
• Estimating statistical distributions using an integral identity
• Efficient simulated tempering with approximated weights: Applications to first-order phase transitions
• Almost sure convergence of the accelerated weight histogram algorithm