Related papers: kmos: A lattice kinetic Monte Carlo framework
The basic idea of fast Monte Carlo (MC) simulations is to perform particle-based MC simulations with the excluded-volume interactions modeled by "soft" repulsive potentials that allow particle overlapping. This gives much faster system…
An off-lattice, continuous space Kinetic Monte Carlo (KMC) algorithm is discussed and applied in the investigation of strained heteroepitaxial crystal growth. As a starting point, we study a simplifying (1+1)-dimensional situation with…
Monte Carlo (MC) simulations are essential computational approaches with widespread use throughout all areas of science. We present a method for accelerating lattice MC simulations using fully connected and convolutional artificial neural…
One bottleneck of quantum Monte Carlo (QMC) simulation of strongly correlated electron systems lies at the scaling relation of computational complexity with respect to the system sizes. For generic lattice models of interacting fermions,…
This paper presents a class of one-dimensional cellular automata (CA) models on traffic flows, featuring nonlocal look-ahead interactions. We develop kinetic Monte Carlo (KMC) algorithms to simulate the dynamics. The standard KMC method can…
Microscopic processes on surfaces such as adsorption, desorption, diffusion and reaction of interacting particles can be simulated using kinetic Monte Carlo (kMC) algorithms. Even though kMC methods are accurate, they are computationally…
To better understand the capture process by a nanopore, we introduce an efficient Kinetic Monte Carlo (KMC) algorithm that can simulate long times and large system sizes by mapping the dynamic of a point-like particle in a 3D spherically…
Various kinetic Monte Carlo algorithms become inefficient when some of the population sizes in a system are large, which gives rise to a large number of reaction events per unit time. Here, we present a new acceleration algorithm based on…
In plasma edge simulations, the behavior of neutral particles is often described by a Boltzmann--BGK equation. Solving this kinetic equation and estimating the moments of its solution are essential tasks, typically carried out using Monte…
In plasma edge simulations, kinetic Monte Carlo (MC) is often used to simulate neutral particles and estimate source terms. For large-sized reactors, like ITER and DEMO, high particle collision rates lead to a substantial computational cost…
We present the Monte Carlo with Absorbing Markov Chains (MCAMC) method for extremely long kinetic Monte Carlo simulations. The MCAMC algorithm does not modify the system dynamics. It is extremely useful for models with discrete state spaces…
We determine the critical layer thickness for the appearance of misfit dislocations as a function of the misfit between the lattice constants of the substrate and the adsorbate from Kinetic Monte Carlo (KMC) simulations of heteroepitaxial…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
We propose an efficient method for Monte Carlo simulation of quantum lattice models. Unlike most other quantum Monte Carlo methods, a single run of the proposed method yields the free energy and the entropy with high precision for the whole…
These are lecture notes of a course that I gave to people doing research for their Ph.D. thesis in theoretical chemistry or spectroscopy. The course was given on December 9-13, 2002, in Han-sur-Lesse, Belgium. The lecture notes start with…
The standard kinetic Monte Carlo algorithm is an extremely efficient method to carry out serial simulations of dynamical processes such as thin-film growth. However, in some cases it is necessary to study systems over extended time and…
We develop a coarse grained (CG) approach for efficiently simulating calcium dynamics in the endoplasmic reticulum membrane based on a fine stochastic lattice gas model. By grouping neighboring microscopic sites together into CG cells and…
In this work, we introduce a simple modification of the Monte Carlo algorithm, which we call step Monte Carlo (sMC). The sMC approach allows to simulate processes far from equilibrium and obtain information about the dynamic properties of…
A kinetic over-relaxation minimizer, based on a lattice version of the Boltzmann equation is presented. The method is validated against standard Metropolis Monte Carlo, and proves very effective in attaining (global) minima of classical…
A rigourous Monte Carlo method for protein folding simulation on lattice model is introduced. We show that a parameter which can be seen as the rigidity of the conformations has to be introduced in order to satisfy the detailed balance…