𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient kinetic Monte Carlo simulation

✍ Scribed by Tim P. Schulze

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
160 KB
Volume
227
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

✦ Synopsis

This paper concerns kinetic Monte Carlo (KMC) algorithms that have a single-event execution time independent of the system size. Two methods are presented-one that combines the use of inverted-list data structures with rejection Monte Carlo and a second that combines inverted lists with the Marsaglia-Norman-Cannon algorithm. The resulting algorithms apply to models with rates that are determined by the local environment but are otherwise arbitrary, time-dependent and spatially heterogeneous. While especially useful for crystal growth simulation, the algorithms are presented from the point of view that KMC is the numerical task of simulating a single realization of a Markov process, allowing application to a broad range of areas where heterogeneous random walks are the dominate simulation cost.

πŸ“œ SIMILAR VOLUMES

Monte Carlo simulation of the kinetics o
Monte Carlo simulation of the kinetics of protein adsorption
✍ V.P. Zhdanov; B. Kasemo πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 98 KB πŸ‘ 2 views

Adsorption of proteins occurs via diffusion toward the interface, actual adsorption, and subsequent irreversible conformational changes resulting in denaturation of the native protein structure. The conventional kinetic models describing these steps are based on the assumption that the denaturation

Tracking Explicit Chain Sequence in Kine
Tracking Explicit Chain Sequence in Kinetic Monte Carlo Simulations
✍ Lin Wang; Linda J. Broadbelt πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 408 KB

## Abstract The execution of individual KMC events can become a major computational bottleneck in the simulation of sequences along chains using KMC because of complex data storage schemes required to record the sequence of each chain. The execution of a KMC event can be very time‐consuming because

Hybrid Monte Carlo: An efficient algorit
Hybrid Monte Carlo: An efficient algorithm for condensed matter simulation
✍ M. E. Clamp; P. G. Baker; C. J. Stirling; A. Brass πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 624 KB

## Abstract A detailed comparison has been made of the performance of molecular dynamics and hybrid Monte Carlo simulation algorithms for calculating thermodynamic properties of 2D Lennard‐Jonesium. The hybrid Monte Carlo simulation required an order of magnitude fewer steps than the molecular dyna