Control of accuracy in the Wang-Landau algorithm

Blume-Capel model analysis with a microcanonical population annealing method

We present a modification of the Rose-Machta algorithm [N. Rose and J. Machta, Phys. Rev. E 100, 063304 (2019)2470-004510.1103/PhysRevE.100.063304] and estimate the density of states for a two-dimensional Blume-Capel model, simulating 10^{5} replicas in parallel for each set of parameters. We perform a finite-size analysis of the specific heat and Binder cumulant, determine the critical temperature along the critical line, and evaluate the critical exponents. The obtained results are in good agreement with those previously obtained using various methods-Markov chain Monte Carlo simulation, Wang-Landau simulation, transfer matrix, and series expansion. The simulation results clearly illustrate the typical behavior of specific heat along the critical lines and through the tricritical point.

A Deep Graph Network-Enhanced Sampling Approach to Efficiently Explore the Space of Reduced Representations of Proteins

The limits of molecular dynamics (MD) simulations of macromolecules are steadily pushed forward by the relentless development of computer architectures and algorithms. The consequent explosion in the number and extent of MD trajectories induces the need for automated methods to rationalize the raw data and make quantitative sense of them. Recently, an algorithmic approach was introduced by some of us to identify the subset of a protein's atoms, or mapping, that enables the most informative description of the system. This method relies on the computation, for a given reduced representation, of the associated mapping entropy, that is, a measure of the information loss due to such simplification; albeit relatively straightforward, this calculation can be time-consuming. Here, we describe the implementation of a deep learning approach aimed at accelerating the calculation of the mapping entropy. We rely on Deep Graph Networks, which provide extreme flexibility in handling structured input data and whose predictions prove to be accurate and-remarkably efficient. The trained network produces a speedup factor as large as 105 with respect to the algorithmic computation of the mapping entropy, enabling the reconstruction of its landscape by means of the Wang-Landau sampling scheme. Applications of this method reach much further than this, as the proposed pipeline is easily transferable to the computation of arbitrary properties of a molecular structure.

A journey through mapping space: characterising the statistical and metric properties of reduced representations of macromolecules

ABSTRACT

A mapping of a macromolecule is a prescription to construct a simplified representation of the system in which only a subset of its constituent atoms is retained. As the specific choice of the mapping affects the analysis of all-atom simulations as well as the construction of coarse-grained models, the characterisation of the mapping space has recently attracted increasing attention. We here introduce a notion of scalar product and distance between reduced representations, which allows the study of the metric and topological properties of their space in a quantitative manner. Making use of a Wang-Landau enhanced sampling algorithm, we exhaustively explore such space, and examine the qualitative features of mappings in terms of their squared norm. A one-to-one correspondence with an interacting lattice gas on a finite volume leads to the emergence of discontinuous phase transitions in mapping space, which mark the boundaries between qualitatively different reduced representations of the same molecule.

Flat-histogram method comparison on the two-dimensional Ising model

We compare the convergence of several flat-histogram methods applied to the two-dimensional Ising model, including the recently introduced stochastic approximation with a dynamic update factor (SAD) method. We compare this method to the Wang-Landau (WL) method, the 1/t variant of the WL method, and standard stochastic approximation Monte Carlo (SAMC). In addition, we consider a procedure WL followed by a "production run" with fixed weights that refines the estimation of the entropy. We find that WL followed by a production run does converge to the true density of states, in contrast to pure WL. Three of the methods converge robustly: SAD, 1/t-WL, and WL followed by a production run. Of these, SAD does not require a priori knowledge of the energy range. This work also shows that WL followed by a production run performs superior to other forms of WL while ensuring both ergodicity and detailed balance.