Related papers: Wang-Landau/Multibondic Cluster Simulations for Se…
We study the thermodynamic properties of the three-dimensional Blume-Capel model on the simple cubic lattice by means of computer simulations. In particular, we implement a parallelized variant of the multicanonical approach and perform…
Performance of Wang-Landau (W-L) algorithm in two continuous spin models is tested by determining the fluctuations in energy histogram. Finite size scaling is performed on a modified XY-model using different W-L sampling schemes.…
The three-dimensional bimodal random-field Ising model is investigated using the N-fold version of the Wang-Landau algorithm. The essential energy subspaces are determined by the recently developed critical minimum energy subspace…
We propose a strategy to achieve the fastest convergence in the Wang-Landau algorithm with varying modification factors. With this strategy, the convergence of a simulation is at least as good as the conventional Monte Carlo algorithm, i.e.…
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…
Numerical linked-cluster expansions allow one to calculate finite-temperature properties of quantum lattice models directly in the thermodynamic limit through exact solutions of small clusters. However, full diagonalization is often the…
Metropolis algorithm has been extensively employed for simulating a canonical ensemble and estimating macroscopic properties of a closed system at any desired temperature. A mechanical property, like energy can be calculated by averaging…
We propose a cluster simulation algorithm for statistical ensembles with fixed order parameter. We use the tethered ensemble, which features Helmholtz's effective potential rather than Gibbs's free energy, and in which canonical averages…
In this paper, we present a parallel algorithm for Monte Carlo simulation of the 2D Ising Model to perform efficiently on a cluster computer using MPI. We use C++ programming language to implement the algorithm. In our algorithm, every…
Monte Carlo simulations are used to study lattice gases of particles with extended hard cores on a two dimensional square lattice. Exclusions of one and up to five nearest neighbors (NN) are considered. These can be mapped onto hard squares…
Monte Carlo cluster algorithms are popular for their efficiency in studying the Ising model near its critical temperature. We might expect that this efficiency extends to the bond-diluted Ising model. We show, however, that this is not…
Energy functions for pure and heterogenous systems are one of the backbones for molecular simulation of condensed phase systems. With the advent of machine learned potential energy surfaces (ML-PESs) a new era has started. Statistical…
We have simulated the three-dimensional Heisenberg model on simple cubic lattices, using the single-cluster Monte Carlo update algorithm. The expected pronounced reduction of critical slowing down at the phase transition is verified. This…
A Microcanonical Finite Site Ansatz in terms of quantities measurable in a Finite Lattice allows to extend phenomenological renormalization (the so called quotients method) to the microcanonical ensemble. The Ansatz is tested numerically in…
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…
A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical…
To investigate order-order interfaces, we perform multimagnetical Monte Carlo simulations of the $2D$ and $3D$ Ising model. Stringent tests of the numerical methods are performed by reproducing with high precision exact $2D$ results. In the…
We present an efficient Monte Carlo algorithm for determining the density of states which is based on the statistics of transition probabilities between states. By measuring the infinite temperature transition probabilities--that is, the…
The multiple range random walk algorithm recently proposed by Wang and Landau [Phys. Rev. Lett. 86, 2050 (2001)] is adapted to the computation of free energy profiles for molecular systems along reaction coordinates. More generally, we show…
An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…