Related papers: Entropic algorithms and the lid method as explorat…
The `lid' algorithm performs an exhaustive exploration of neighborhoods of local energy minima of energy landscapes. This paper describes an implementation of the algorithm, including issues of parallel performance and scalability. To…
Wang and Landau proposed recently, a simple and flexible non-Boltzmann Monte Carlo method for estimating the density of states, from which the macroscopic properties of a closed system can be calculated. They demonstrated their algorithm by…
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…
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…
In this work we develop an implementation of the Wang--Landau algorithm [Phys. Rev. Lett. \textbf{86}, 2050-2053 (2001)]. This algorithm allows us to find the density of states (DOS), a function that, for a given system, describes the…
We calculate the density of states of a binary Lennard-Jones glass using a recently proposed Monte Carlo algorithm. Unlike traditional molecular simulation approaches, the algorithm samples distinct configurations according to…
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…
We investigate the energy landscape of two dimensional network models for covalent glasses by means of the lid algorithm. For three different particle densities and for a range of network sizes, we exhaustively analyse many configuration…
Evaluation of global thermodynamic properties, such as the entropy or the free energy, of complex systems featuring a high degree of frustration or disorder is often desirable. Nevertheless, they cannot be measured directly in standard…
In Wang-Landau type algorithms, Monte-Carlo updates are performed with respect to the density of states, which is iteratively refined during simulations. The partition function and thermodynamic observables are then obtained by standard…
We propose a method based on the Wang-Landau algorithm to numerically generate the spectral densities of random matrix ensembles. The method employs Dyson's log-gas formalism for random matrix eigenvalues and also enables one to…
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…
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…
Monte Carlo simulations using Wang-Landau sampling are performed to study three-dimensional chains of homopolymers on a lattice. We confirm the accuracy of the method by calculating the thermodynamic properties of this system. Our results…
We present a statistical method for complex energy landscape exploration which provides information on the metastable states--or valleys--actually explored by an unperturbed aging process following a quench. Energy fluctuations of record…
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…
We present a method for estimating the density of states of a classical statistical model. The algorithm successfully combines the Wang-Landau flat histogram method with the N-fold way in order to improve efficiency of the original single…
An algorithm to calculate the density of states, based on the well-known Wang-Landau method, is introduced. Independent random walks are performed in different restricted ranges of energy, and the resultant density of states is modified by…
Dominant energy subspaces of statistical systems are defined with the help of restrictive conditions on various characteristics of the energy distribution, such as the probability density and the forth order Binder's cumulant. Our analysis…
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…