Net-event kinetic Monte Carlo for overcoming stiffness in spatially homogeneous and distributed systems

A probabilistic microkinetic modeling framework for catalytic surface reactions

We present a probabilistic microkinetic modeling (MKM) framework that incorporates the short-ranged order (SRO) evolution for adsorbed species (adspecies) on a catalyst surface. The resulting model consists of a system of ordinary differential equations. Adsorbate-adsorbate interactions, surface diffusion, adsorption, desorption, and catalytic reaction processes are included. Assuming that the adspecies ordering/arrangement is accurately described by the SRO parameters, we employ the reverse Monte Carlo (RMC) method to extract the relevant local environment probability distributions and pass them to the MKM. The reaction kinetics is faithfully captured as accurately as the kinetic Monte Carlo (KMC) method but with a computational time requirement of few seconds on a standard desktop computer. KMC, on the other hand, can require several days for the examples discussed. The framework presented here is expected to provide the basis for wider application of the RMC-MKM approach to problems in computational catalysis, electrocatalysis, and material science.

The enhanced extended phenomenological kinetics method to deal with timescale disparity problem among different reaction pathways

Kinetic Monte Carlo method can provide valuable mechanistic insights for catalytic systems. Nonetheless, it suffers from the notorious problem of timescale disparity due to the existence of the complex catalytic network that consists of fast events and slow events. Previously, we have proposed the extended phenomenological kinetics (XPK) method that effectively deals with the timescale disparity problem between diffusion and reaction. However, it remains a great challenge to simulate systems with timescale disparity among different reaction pathways, which is important when selectivity is the major concern. In this study, we implement the enhanced XPK method to address this problem. The new algorithm works by identifying states connected through fast transitions and compressing them into a "superstate" when the chosen states satisfy a local steadystate condition. This state compression algorithm simplifies the reaction network by concealing the fast transitions. The accuracy and efficiency of the algorithm are demonstrated by two model systems: selective catalytic hydrogenation and selective catalytic decomposition. The enhanced XPK method is expected to be beneficial to the kinetic simulations of catalytic systems, especially those with complex reaction networks.

Acceleration scheme for particle transport in kinetic Monte Carlo methods

Kinetic Monte Carlo (kMC) simulations are frequently used to study (electro-)chemical processes within science and engineering. kMC methods provide insight into the interplay of stochastic processes and can link atomistic material properties with macroscopic characteristics. Significant problems concerning the computational demand arise if processes with large time disparities are competing. Acceleration algorithms are required to make slow processes accessible. Especially, the accelerated superbasin kMC (AS-kMC) scheme has been frequently applied within chemical reaction networks. For larger systems, the computational overhead of the AS-kMC is significant as the computation of the superbasins is done during runtime and comes with the need for large databases. Here, we propose a novel acceleration scheme for diffusion and transport processes within kMC simulations. Critical superbasins are detected during the system initialization. Scaling factors for the critical rates within the superbasins, as well as a lower bound for the number of sightings, are derived. Our algorithm exceeds the AS-kMC in the required simulation time, which we demonstrate with a 1D-chain example. In addition, we apply the acceleration scheme to study the time-of-flight (TOF) of charge carriers within organic semiconductors. In this material class, time disparities arise due to a significant spread of transition rates. The acceleration scheme allows a significant acceleration up to a factor of 65 while keeping the error of the TOF values negligible. The computational overhead is negligible, as all superbasins only need to be computed once.

A new class of enhanced kinetic sampling methods for building Markov state models

Markov state models (MSMs) and other related kinetic network models are frequently used to study the long-timescale dynamical behavior of biomolecular and materials systems. MSMs are often constructed bottom-up using brute-force molecular dynamics (MD) simulations when the model contains a large number of states and kinetic pathways that are not known a priori. However, the resulting network generally encompasses only parts of the configurational space, and regardless of any additional MD performed, several states and pathways will still remain missing. This implies that the duration for which the MSM can faithfully capture the true dynamics, which we term as the validity time for the MSM, is always finite and unfortunately much shorter than the MD time invested to construct the model. A general framework that relates the kinetic uncertainty in the model to the validity time, missing states and pathways, network topology, and statistical sampling is presented. Performing additional calculations for frequently-sampled states/pathways may not alter the MSM validity time. A new class of enhanced kinetic sampling techniques is introduced that aims at targeting rare states/pathways that contribute most to the uncertainty so that the validity time is boosted in an effective manner. Examples including straightforward 1D energy landscapes, lattice models, and biomolecular systems are provided to illustrate the application of the method. Developments presented here will be of interest to the kinetic Monte Carlo community as well.

The diffusion of a Ga atom on GaAs(001)β2(2 × 4): Local superbasin kinetic Monte Carlo

We use first-principles density-functional theory to characterize the binding sites and diffusion mechanisms for a Ga adatom on the GaAs(001)β2(2 × 4) surface. Diffusion in this system is a complex process involving eleven unique binding sites and sixteen different hops between neighboring binding sites. Among the binding sites, we can identify four different superbasins such that the motion between binding sites within a superbasin is much faster than hops exiting the superbasin. To describe diffusion, we use a recently developed local superbasin kinetic Monte Carlo (LSKMC) method, which accelerates a conventional kinetic Monte Carlo (KMC) simulation by describing the superbasins as absorbing Markov chains. We find that LSKMC is up to 4300 times faster than KMC for the conditions probed in this study. We characterize the distribution of exit times from the superbasins and find that these are sometimes, but not always, exponential and we characterize the conditions under which the superbasin exit-time distribution should be exponential. We demonstrate that LSKMC simulations assuming an exponential superbasin exit-time distribution yield the same diffusion coefficients as conventional KMC.

A local superbasin kinetic Monte Carlo method

We present a local superbasin kinetic Monte Carlo (LSKMC) method that efficiently treats multiple-time-scale problems in kinetic Monte Carlo (KMC). The method is designed to solve the small-barrier problem created by groups of recurrent free-energy minima connected by low free-energy barriers and separated from the full phase space of the system by high barriers. We propose an algorithm to detect, on the fly, groups of recurrent free-energy minima connected by low free-energy barriers and to consolidate them into "superbasins," which we treat with rate equations and/or absorbing Markov chains. We discuss various issues involved with implementing LSKMC simulations that contain local superbasins and non-superbasin events concurrently. These issues include the time distribution of superbasin escapes and interactions between superbasin and non-superbasin states. The LSKMC method is exact, as it introduces no new approximations into conventional KMC simulations. We demonstrate various aspects of LSKMC in several examples, which indicate that significant increases in computational efficiency can be achieved using this method.

Coarse-grained kinetic Monte Carlo models: Complex lattices, multicomponent systems, and homogenization at the stochastic level

On-lattice kinetic Monte Carlo (KMC) simulations have extensively been applied to numerous systems. However, their applicability is severely limited to relatively short time and length scales. Recently, the coarse-grained MC (CGMC) method was introduced to greatly expand the reach of the lattice KMC technique. Herein, we extend the previous spatial CGMC methods to multicomponent species and/or site types. The underlying theory is derived and numerical examples are presented to demonstrate the method. Furthermore, we introduce the concept of homogenization at the stochastic level over all site types of a spatially coarse-grained cell. Homogenization provides a novel coarsening of the number of processes, an important aspect for complex problems plagued by the existence of numerous microscopic processes (combinatorial complexity). As expected, the homogenized CGMC method outperforms the traditional KMC method on computational cost while retaining good accuracy.

Temporal coarse-graining of microscopic-lattice kinetic Monte Carlo simulations via tau leaping

A coarse-time-step method is presented that enables the execution of multiple events at each time increment of microscopic-lattice kinetic Monte Carlo simulations. The method employs the n-fold method to create groups of reactions in which the tau-leap algorithm of Gillespie, originally proposed for well-mixed systems, is applied. Creation of groups of reactions is an essential step to avoid violation of the leap condition that arises when the tau-leap algorithm is applied to a single site. The method is general, very easy to implement, and can result in substantial computational savings when global updating is employed. An illustrative example from crystal growth of a simple cubic lattice with the solid-on-solid approximation is presented.

Stochastic simulation of catalytic surface reactions in the fast diffusion limit

The master equation of a lattice gas reaction tracks the probability of visiting all spatial configurations. The large number of unique spatial configurations on a lattice renders master equation simulations infeasible for even small lattices. In this work, a reduced master equation is derived for the probability distribution of the coverages in the infinite diffusion limit. This derivation justifies the widely used assumption that the adlayer is in equilibrium for the current coverages and temperature when all reactants are highly mobile. Given the reduced master equation, two novel and efficient simulation methods of lattice gas reactions in the infinite diffusion limit are derived. The first method involves solving the reduced master equation directly for small lattices, which is intractable in configuration space. The second method involves reducing the master equation further in the large lattice limit to a set of differential equations that tracks only the species coverages. Solution of the reduced master equation and differential equations requires information that can be obtained through short, diffusion-only kinetic Monte Carlo simulation runs at each coverage. These simulations need to be run only once because the data can be stored and used for simulations with any set of kinetic parameters, gas-phase concentrations, and initial conditions. An idealized CO oxidation reaction mechanism with strong lateral interactions is used as an example system for demonstrating the reduced master equation and deterministic simulation techniques.

Overcoming stiffness in stochastic simulation stemming from partial equilibrium: A multiscale Monte Carlo algorithm

In this paper the problem of stiffness in stochastic simulation of singularly perturbed systems is discussed. Such stiffness arises often from partial equilibrium or quasi-steady-state type of conditions. A multiscale Monte Carlo method is discussed that first assesses whether partial equilibrium is established using a simple criterion. The exact stochastic simulation algorithm (SSA) is next employed to sample among fast reactions over short time intervals (microscopic time steps) in order to compute numerically the proper probability distribution function for sampling the slow reactions. Subsequently, the SSA is used to sample among slow reactions and advance the time by large (macroscopic) time steps. Numerical examples indicate that not only long times can be simulated but also fluctuations are properly captured and substantial computational savings result.

Molecular sieve valves driven by adsorbate-adsorbate interactions: hysteresis in permeation of microporous membranes

A recently derived mesoscopic framework describing activated micropore diffusion is employed to explore system criticality in microporous membranes under nonequilibrium conditions. Rapid exploration of parameter space, possible with this continuum framework, elucidates a novel temperature-induced ignition and extinction of the molecular flux under a macroscopic gradient in pressure (chemical potential). Deviation from equilibrium like phase behavior (i.e., shifting and narrowing of phase envelopes and double hysteresis) derives from asymmetry of the coupled boundaries of the nonequilibrium membrane. We confirm this new phase behavior, akin to "opening" and "closing" of a molecular valve, via gradient kinetic Monte Carlo simulations of thin one-dimensional and three-dimensional systems. The heat of adsorption, strength of adsorbate-adsorbate intermolecular forces, and chemical potential gradient are all shown to control 'valve' actuation, suggesting potential implications in chemical sensing and novel diffusion control.