2014
DOI: 10.1016/j.jcp.2013.08.053
|View full text |Cite
|
Sign up to set email alerts
|

An exact and efficient first passage time algorithm for reaction–diffusion processes on a 2D-lattice

Abstract: We present an exact and efficient algorithm for reaction-diffusion-nucleation processes on a 2D-lattice. The algorithm makes use of first passage time (FPT) to replace the computationally intensive simulation of diffusion hops in KMC by larger jumps when particles are far away from step-edges or other particles. Our approach computes exact probability distributions of jump times and target locations in a closed-form formula, based on the eigenvectors and eigenvalues of the corresponding 1D transition matrix, m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 15 publications
(21 citation statements)
references
References 37 publications
(50 reference statements)
0
21
0
Order By: Relevance
“…To incorporate diffusion into the stochastic simulations, we use a First Passage Time Kinetic Monte Carlo algorithm, based on ref. [50]. We assume the enzyme travels with 1D diffusion coefficient D and unbinds with rate k off .…”
Section: Plos Computational Biologymentioning
confidence: 99%
“…To incorporate diffusion into the stochastic simulations, we use a First Passage Time Kinetic Monte Carlo algorithm, based on ref. [50]. We assume the enzyme travels with 1D diffusion coefficient D and unbinds with rate k off .…”
Section: Plos Computational Biologymentioning
confidence: 99%
“…To incorporate diffusion into the stochastic simulations, we use a First Passage Time Kinetic Monte Carlo algorithm, based on ref. [50]. We assume the enzyme travels with 1D diffusion coefficient D and unbinds with rate k of f .…”
Section: Processive Mechanismmentioning
confidence: 99%
“…While the calculation of first passage times in continua requires the numerical calculation of the Green's function, the first passage time on discrete lattices can be calculated efficiently in closed form. 17 The ELFPT method is accurate over large distances with atomic scale resolution, and is considerably faster for conditions where the (D/F) ratio is high. The performance of ELFPT relies on the ability to quickly compute exact exit-time distributions and to determine distances to the nearest walker and deposited islands.…”
Section: Computational Methodologymentioning
confidence: 99%
“…The performance of ELFPT relies on the ability to quickly compute exact exit-time distributions and to determine distances to the nearest walker and deposited islands. For ideal situations where adatoms diffuse over large distances before nucleating or attaching to islands, it was found 17 that the method achieved a speedup up to 100× over comparable KMC simulations.…”
Section: Computational Methodologymentioning
confidence: 99%