Related papers: Control of accuracy in the Wang-Landau algorithm
In this work we investigate the behavior of the microcanonical and canonical averages of the two-dimensional Ising model during the Wang-Landau simulation. The simulations were carried out using conventional Wang-Landau sampling and the…
We apply the recently developed critical minimum energy subspace scheme for the investigation of the random-field Ising model. We point out that this method is well suited for the study of this model. The density of states is obtained via…
We implement the Wang-Landau algorithm in the context of SU(N) lattice gauge theories. We study the quenched, reduced version of the lattice theory and calculate its density of states for N=20,30,40,50. We introduce a variant of the…
It is shown in this work how the Wang-Landau algorithm can be parallelized through the concept of the micromagnetic ensemble, when the Hamiltonian contains both spin interaction and the external field terms, and thus energy-magnetization…
Using extensive Monte Carlo simulations, we study the interface localization- delocalization transition of a thin Ising film with antisymmetric competing walls for a set of parameters where the transition is strongly first-order. This is…
We apply the Wang-Landau method to the study of the critical behaviour of the three dimensional Random Field Ising Model with a bimodal probability distribution. Our results show that for high values of the random field intensity the…
Triangulations are important objects of study in combinatorics, finite element simulations and quantum gravity, where its entropy is crucial for many physical properties. Due to their inherent complex topological structure even the number…
Learning in neural networks critically hinges on the intricate geometry of the loss landscape associated with a given task. Traditionally, most research has focused on finding specific weight configurations that minimize the loss. In this…
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 present a new Monte Carlo algorithm applying a history-driven mechanism for the calculation of the density of states for classical statistical models. The new method is as efficient as the Wang-Landau method in sampling through the…
We consider a class of systems where $N$ identical particles with positions ${\bf q}_1,...,{\bf q}_N$ and momenta ${\bf p}_1,...,{\bf p}_N$ are enclosed in a box of size $L$, and exhibit the scaling $\mathcal{U}(L{\bf r}_1,...,L{\bf…
When studying high-dimensional dynamical systems such as macromolecules, quantum systems and polymers, a prime concern is the identification of the most probable states and their stationary probabilities or free energies. Often, these…
A simple solid-on-solid model of adsorbate-induced faceting is studied by using a modified Wang-Landau method. The phase diagram for this system is constructed by computing the density of states in a special two-dimensional energy space. A…
We describe the study of thermodynamics of materials using replica-exchange Wang-Landau (REWL) sampling, a generic framework for massively parallel implementations of the Wang-Landau Monte Carlo method. To evaluate the performance and…
In this short note, we show how the parallel adaptive Wang-Landau (PAWL) algorithm of Bornn et al. (2013) can be used to automate and improve simulated tempering algorithms. While Wang-Landau and other stochastic approximation methods have…
We present a rigorous derivation for off-lattice implementations of the so-called "random-walk" algorithm recently introduced by Wang and Landau [PRL 86, 2050 (2001)]. Originally developed for discrete systems, the algorithm samples…
Combining traditional Wang-Landau sampling for multiple replica systems with an exchange of densities of states between replicas, we describe a general framework for simulations on massively parallel Petaflop supercomputers. The advantages…
An efficient numerical method is developed using the matrix product formalism for computing the properties at finite energy densities in one-dimensional (1D) many-body localized (MBL) systems. Arguing that any efficient (possibly quantum)…
It has been shown that the Metropolis algorithm can be implemented on quantum computers in a way that avoids the sign problem. However, flat histogram techniques are often preferred as they don't suffer from the same limitations that…
Wang-Landau simulations offer the possibility to integrate explicitly over a collective coordinate and stochastically over the remainder of configuration space. We propose to choose the so-called "slow mode", which is responsible for large…