Transition Matrix Cluster Algorithms
arXiv:1803.10907 · doi:10.1142/S0129183119500049
Abstract
We demonstrate that a series of procedures for increasing the efficiency of transition matrix calculations can be realized by integrating the standard single-spin flip transition matrix method with global cluster flipping techniques. Our calculations employ a simple and accurate method based on detailed balance for computing the density of states from the Ising model transition matrix.
References in corpus (17)
- An efficient, multiple range random walk algorithm to calculate the density of states
- Multicanonical Ensemble: A New Approach to Simulate First-order Phase Transitions
- Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogram
- Self-Learning Monte Carlo Method
- Fast Algorithm to Calculate Density of States
- On the Wang-Landau Method for Off-Lattice Simulations in the "Uniform" Ensemble
- Transition Matrix Monte Carlo Method
- Transition Matrix Monte Carlo Reweighting and Dynamics
- Algorithmic aspects of multicanonical simulations
- Invaded cluster algorithm for Potts models
- Broad Histogram Monte Carlo
- Optimal Modification Factor and Convergence of the Wang-Landau Algorithm
- Transition Matrix Monte Carlo Method
- Computer simulation of two continuous spin models using Wang-Landau-Transition-Matrix Monte Carlo Algorithm
- Dynamic Canonical and Microcanonical Transition Matrix Analyses of Critical Behavior
- Accelerated rare event sampling
- Renormalized Multicanonical Sampling