Dynamical integration of a Markovian web: A first passage time approach

Event horizon kinetic Monte Carlo

In this study, we present a novel approach for modeling the dynamics of stochastic processes. The fundamental concept involves constructing a stochastic Markov chain comprising states separated by more than one stochastic event. Initially, the method explores the network of neighboring states connected by stochastic events. This exploration results in a "horizon" of events leading to a set of "boundary" states at the periphery of each local network. Subsequently, the next member in the Markov chain is selected from the "boundary" states based on the probability of reaching each of the "boundary" states for the first time. Meanwhile, the simulation clock is updated according to the time required to reach the boundary for the first time. This can be achieved using an analytical approach, where the probability of reaching each boundary state for the first time is estimated using absorbing conditions for all boundary states in the analytical solution of a master equation describing the local network of states around each current state. The proposed method is demonstrated in modeling the dynamics in networks of stochastic reactions but can be easily applied in any stochastic system whose dynamics can be expressed via the solution of a master equation. It is expected to enhance the efficiency of event-driven Monte Carlo simulations, originally introduced by Gillespie and widely regarded as the gold standard in the field, especially in cases where the presence of events is characterized by different timescales.

Accessible Molecular System Creator: Building Molecular Configurations Based on the Inaccessible Molecular Volume and Accessible Molecular Surface via Static Monte Carlo Sampling

Monte Carlo (MC) stochastic sampling is a powerful tool in classical molecular simulations that directly connects the observable macroscopic properties of matter and the underlying atomistic interactions. This connection operates within the framework of the statistical mechanics proposed by Gibbs. Most MC simulations are "dynamic," creating statistical ensembles of microstates via a Markovian chain, where each microstate in the ensemble depends only on its previous microstate. Herein, we re-examine an alternative form of MC that generates ensemble members through a "static" approach, building molecular systems stepwise. The basic theory for such an approach traces back to Rosenbluth and Rosenbluth, who proposed "static" stepwise sampling of a polymeric chain. It is almost as old as the Metropolis importance sampling approach used in dynamic MC, although the latter has been considerably more popular than the former. Herein, we address the main obstacle in static MC that has hindered the widespread adoption of Rosenbluth-based approaches in atomistic simulations. The obstacle lies in mapping the molecular accessible volume for adding a molecule in a Rosenbluth-like static sampling of atomistic configurations. We demonstrate a breakthrough by leveraging the ability to analytically map the inaccessible molecular volume and the accessible molecular surface owing to interatomically excluded volume interactions. This advance substantially enhances the ability to create molecular samples using a Rosenbluth-like static building process. The proposed approach can be used as a tool for creating initial configurations in MC or molecular dynamics simulations─a field where Rosenbluth-like static building has been applied. Additionally, this approach can be used as the first step in a perturbation scheme that accurately estimates free energy differences by estimating the chemical work related to molecule addition, removal, or reinsertion within the context of free energy perturbation schemes employed in molecular simulations.

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.

Defining, Calculating, and Converging Observables of a Kinetic Transition Network

Kinetic transition networks (KTNs) of local minima and transition states are able to capture the dynamics of numerous systems in chemistry, biology, and materials science. However, extracting observables is numerically challenging for large networks and generally will be sensitive to additional computational discovery. To have any measure of convergence for observables, these sensitivities must be regularly calculated. We present a matrix formulation of the discrete path sampling framework for KTNs, deriving expressions for branching probabilities, transition rates, and waiting times. Using the concept of the quasi-stationary distribution, a clear hierarchy of expressions for network observables is established, from exact results to steady-state approximations. We use these results in combination with the graph transformation method to derive the sensitivity, with respect to perturbations of the known KTN, giving explicit terms for the pairwise sensitivity and discussing the pathwise sensitivity. These results provide guidelines for converging the network, with respect to additional sampling, focusing on the estimates obtained for the overall rate coefficients between product and reactant states. We demonstrate this procedure for transitions in the double-funnel landscape of the 38-atom Lennard-Jones cluster.

Computer simulations of glasses: the potential energy landscape

We review the current state of research on glasses, discussing the theoretical background and computational models employed to describe them. This article focuses on the use of the potential energy landscape (PEL) paradigm to account for the phenomenology of glassy systems, and the way in which it can be applied in simulations and the interpretation of their results. This article provides a broad overview of the rich phenomenology of glasses, followed by a summary of the theoretical frameworks developed to describe this phenomonology. We discuss the background of the PEL in detail, the onerous task of how to generate computer models of glasses, various methods of analysing numerical simulations, and the literature on the most commonly used model systems. Finally, we tackle the problem of how to distinguish a good glass former from a good crystal former from an analysis of the PEL. In summarising the state of the potential energy landscape picture, we develop the foundations for new theoretical methods that allow the ab initio prediction of the glass-forming ability of new materials by analysis of the PEL.

Exploring the potential energy landscape of the Thomson problem via Newton homotopies

Locating the stationary points of a real-valued multivariate potential energy function is an important problem in many areas of science. This task generally amounts to solving simultaneous nonlinear systems of equations. While there are several numerical methods that can find many or all stationary points, they each exhibit characteristic problems. Moreover, traditional methods tend to perform poorly near degenerate stationary points with additional zero Hessian eigenvalues. We propose an efficient and robust implementation of the Newton homotopy method, which is capable of quickly sampling a large number of stationary points of a wide range of indices, as well as degenerate stationary points. We demonstrate our approach by applying it to the Thomson problem. We also briefly discuss a possible connection between the present work and Smale's 7th problem.

Path factorization approach to stochastic simulations

The computational efficiency of stochastic simulation algorithms is notoriously limited by the kinetic trapping of the simulated trajectories within low energy basins. Here we present a new method that overcomes kinetic trapping while still preserving exact statistics of escape paths from the trapping basins. The method is based on path factorization of the evolution operator and requires no prior knowledge of the underlying energy landscape. The efficiency of the new method is demonstrated in simulations of anomalous diffusion and phase separation in a binary alloy, two stochastic models presenting severe kinetic trapping.

An inversion-relaxation approach for sampling stationary points of spin model Hamiltonians

Sampling the stationary points of a complicated potential energy landscape is a challenging problem. Here, we introduce a sampling method based on relaxation from stationary points of the highest index of the Hessian matrix. We illustrate how this approach can find all the stationary points for potentials or Hamiltonians bounded from above, which includes a large class of important spin models, and we show that it is far more efficient than previous methods. For potentials unbounded from above, the relaxation part of the method is still efficient in finding minima and transition states, which are usually the primary focus of attention for atomistic systems.

Temporal disconnectivity of the energy landscape in glassy systems

An alternative graphical representation of the potential energy landscape (PEL) has been developed and applied to a binary Lennard-Jones glassy system, providing insight into the unique topology of the system's potential energy hypersurface. With the help of this representation one is able to monitor the different explored basins of the PEL, as well as how--and mainly when--subsets of basins communicate with each other via transitions in such a way that details of the prior temporal history have been erased, i.e., local equilibration between the basins in each subset has been achieved. In this way, apart from detailed information about the structure of the PEL, the system's temporal evolution on the PEL is described. In order to gather all necessary information about the identities of two or more basins that are connected with each other, we consider two different approaches. The first one is based on consideration of the time needed for two basins to mutually equilibrate their populations according to the transition rate between them, in the absence of any effect induced by the rest of the landscape. The second approach is based on an analytical solution of the master equation that explicitly takes into account the entire explored landscape. It is shown that both approaches lead to the same result concerning the topology of the PEL and dynamical evolution on it. Moreover, a "temporal disconnectivity graph" is introduced to represent a lumped system stemming from the initial one. The lumped system is obtained via a specially designed algorithm [N. Lempesis, D. G. Tsalikis, G. C. Boulougouris, and D. N. Theodorou, J. Chem. Phys. 135, 204507 (2011)]. The temporal disconnectivity graph provides useful information about both the lumped and the initial systems, including the definition of "metabasins" as collections of basins that communicate with each other via transitions that are fast relative to the observation time. Finally, the two examined approaches are compared to an "on the fly" molecular dynamics-based algorithm [D. G. Tsalikis, N. Lempesis, G. C. Boulougouris, and D. N. Theodorou, J. Chem. Theory Comput. 6, 1307 (2010)].