Efficient Irreversible Monte Carlo Samplers

Enhancing torsional sampling using fully adaptive simulated tempering

Enhanced sampling algorithms are indispensable when working with highly disconnected multimodal distributions. An important application of these is the conformational exploration of particular internal degrees of freedom of molecular systems. However, despite the existence of many commonly used enhanced sampling algorithms to explore these internal motions, they often rely on system-dependent parameters, which negatively impact efficiency and reproducibility. Here, we present fully adaptive simulated tempering (FAST), a variation of the irreversible simulated tempering algorithm, which continuously optimizes the number, parameters, and weights of intermediate distributions to achieve maximally fast traversal over a space defined by the change in a predefined thermodynamic control variable such as temperature or an alchemical smoothing parameter. This work builds on a number of previously published methods, such as sequential Monte Carlo, and introduces a novel parameter optimization procedure that can, in principle, be used in any expanded ensemble algorithms. This method is validated by being applied on a number of different molecular systems with high torsional kinetic barriers. We also consider two different soft-core potentials during the interpolation procedure and compare their performance. We conclude that FAST is a highly efficient algorithm, which improves simulation reproducibility and can be successfully used in a variety of settings with the same initial hyperparameters.

Variational kinetic clustering of complex networks

Efficiently identifying the most important communities and key transition nodes in weighted and unweighted networks is a prevalent problem in a wide range of disciplines. Here, we focus on the optimal clustering using variational kinetic parameters, linked to Markov processes defined on the underlying networks, namely, the slowest relaxation time and the Kemeny constant. We derive novel relations in terms of mean first passage times for optimizing clustering via the Kemeny constant and show that the optimal clustering boundaries have equal round-trip times to the clusters they separate. We also propose an efficient method that first projects the network nodes onto a 1D reaction coordinate and subsequently performs a variational boundary search using a parallel tempering algorithm, where the variational kinetic parameters act as an energy function to be extremized. We find that maximization of the Kemeny constant is effective in detecting communities, while the slowest relaxation time allows for detection of transition nodes. We demonstrate the validity of our method on several test systems, including synthetic networks generated from the stochastic block model and real world networks (Santa Fe Institute collaboration network, a network of co-purchased political books, and a street network of multiple cities in Luxembourg). Our approach is compared with existing clustering algorithms based on modularity and the robust Perron cluster analysis, and the identified transition nodes are compared with different notions of node centrality.

Diffusion modeling of COVID-19 under lockdown

Viral immune evasion by sequence variation is a significant barrier to severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) vaccine design and coronavirus disease-2019 diffusion under lockdown are unpredictable with subsequent waves. Our group has developed a computational model rooted in physics to address this challenge, aiming to predict the fitness landscape of SARS-CoV-2 diffusion using a variant of the bidimensional Ising model (2DIMV) connected seasonally. The 2DIMV works in a closed system composed of limited interaction subjects and conditioned by only temperature changes. Markov chain Monte Carlo method shows that an increase in temperature implicates reduced virus diffusion and increased mobility, leading to increased virus diffusion.

Simulated tempering with irreversible Gibbs sampling techniques

We present here two novel algorithms for simulated tempering simulations, which break the detailed balance condition (DBC) but satisfy the skewed detailed balance to ensure invariance of the target distribution. The irreversible methods we present here are based on Gibbs sampling and concern breaking DBC at the update scheme of the temperature swaps. We utilize three systems as a test bed for our methods: a Markov chain Monte Carlo simulation on a simple system described by a one-dimensional double well potential, the Ising model, and molecular dynamics simulations on alanine pentapeptide (ALA5). The relaxation times of inverse temperature, magnetic susceptibility, and energy density for the Ising model indicate clear gains in sampling efficiency over conventional Gibbs sampling techniques with DBC and also over the conventionally used simulated tempering with the Metropolis-Hastings (MH) scheme. Simulations on ALA5 with a large number of temperatures indicate distinct gains in mixing times for inverse temperature and consequently the energy of the system compared to conventional MH. With no additional computational overhead, our methods were found to be more efficient alternatives to the conventionally used simulated tempering methods with DBC. Our algorithms should be particularly advantageous in simulations of large systems with many temperature ladders, as our algorithms showed a more favorable constant scaling in Ising spin systems as compared with both reversible and irreversible MH algorithms. In future applications, our irreversible methods can also be easily tailored to utilize a given dynamical variable other than temperature to flatten rugged free energy landscapes.