Related papers: An efficient algorithm for numerical computations …
Monte Carlo algorithms such as the Wang-Landau algorithm and similar `entropic' methods are able to accurately sample the density of states of model systems and thereby give access to thermal equilibrium properties at any temperature.…
Quantum Monte Carlo methods are powerful tools for studying quantum many-body systems but face difficulties in accessing excited states and in treating sign problems. We present a continuous-time path-integral Monte Carlo method for…
The influence of random site dilution on the critical properties of the two-dimensional Ising model on a square lattice was explored by Monte Carlo simulations with the Wang-Landau sampling. The lattice linear size was $L = 20-120$ and the…
We implement a Wang-Landau sampling technique in quantum Monte Carlo (QMC) for the purpose of calculating the Renyi entanglement entropies and associated mutual information. The algorithm converges an estimate for an analogue to the density…
Aiming at evading the notorious sign problem in classical Monte-Carlo approaches to lattice quantum chromodynamics, we present an approach for quantum computing finite-temperature lattice gauge theories at non-zero density. Based on the…
We present high-accuracy calculations of the density of states using multicanonical methods for lattice gauge theory with a compact gauge group U(1) on 4^4, 6^4 and 8^4 lattices. We show that the results are consistent with weak and strong…
While statisticians are well-accustomed to performing exploratory analysis in the modeling stage of an analysis, the notion of conducting preliminary general-purpose exploratory analysis in the Monte Carlo stage (or more generally, the…
We implement the Wang-Landau algorithm to sample with equal probabilities the static configurations of a model granular system. The "non-interacting rigid arch model" used is based on the description of static configurations by means of…
The density of state approach has recently been proposed as a potential route to circumvent the sign problem in systems at finite density. In this study, using the Linear Logarithmic Relaxation (LLR) algorithm, we extract the generalised…
Monte Carlo simulation using the Wang-Landau algorithm has been performed in an one-dimensional Lebwohl-Lasher model. Both one-dimensional and two-dimensional random walks have been carried out. The results are compared with the exact…
Critical properties of lattice gases with nearest-neighbor exclusion are investigated via the adaptive-window Wang-Landau algorithm on the square and simple cubic lattices, for which the model is known to exhibit an Ising-like phase…
In this work we present a theoretical analysis of the convergence of the Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] which was introduced years ago to calculate the density of states in statistical models. We study the…
The Wang-Landau (WL) algorithm has been widely used for simulations in many areas of physics. Our analysis of the WL algorithm explains its properties and shows that the difference of the largest eigenvalue of the transition matrix in the…
Although Monte Carlo calculations using Importance Sampling have matured into the most widely employed method for determining first principle results in QCD, they spectacularly fail for theories with a sign problem or for which certain rare…
A Monte Carlo method based on a density-of-states sampling is proposed for study of arbitrary statistical mechanical ensembles in a continuum. A random walk in the two-dimensional space of particle number and energy is used to estimate the…
We derive a formula that expresses the density of states of a system with continuous degrees of freedom as a function of microcanonical averages of squared gradient and Laplacian of the Hamiltonian. This result is then used to propose a…
The three-dimensional bimodal random-field Ising model is studied via a new finite temperature numerical approach. The methods of Wang-Landau sampling and broad histogram are implemented in a unified algorithm by using the N-fold version of…
We study the convergence of the density of states and thermodynamic properties in three flat-histogram simulation methods, the Wang-Landau (WL) algorithm, the 1/t algorithm, and tomographic sampling (TS). In the first case the refinement…
We develop an approach to apply Wang-Landau algorithm to multicomponent alloys in semi-grand-canonical ensemble. Although the Wang-Landau algorithm has great advantages over conventional sampling methods, there are few applications to…
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…