TY - JOUR

T1 - First-passage kinetic Monte Carlo method

AU - Oppelstrup, Tomas

AU - Bulatov, Vasily V.

AU - Donev, Aleksandar

AU - Kalos, Malvin H.

AU - Gilmer, George H.

AU - Sadigh, Babak

N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - We present an efficient method for Monte Carlo simulations of diffusion-reaction processes. Introduced by us in a previous paper, our algorithm skips the traditional small diffusion hops and propagates the diffusing particles over long distances through a sequence of superhops, one particle at a time. By partitioning the simulation space into nonoverlapping protecting domains each containing only one or two particles, the algorithm factorizes the N -body problem of collisions among multiple Brownian particles into a set of much simpler single-body and two-body problems. Efficient propagation of particles inside their protective domains is enabled through the use of time-dependent Green's functions (propagators) obtained as solutions for the first-passage statistics of random walks. The resulting Monte Carlo algorithm is event-driven and asynchronous; each Brownian particle propagates inside its own protective domain and on its own time clock. The algorithm reproduces the statistics of the underlying Monte Carlo model exactly. Extensive numerical examples demonstrate that for an important class of diffusion-reaction models the algorithm is efficient at low particle densities, where other existing algorithms slow down severely.

AB - We present an efficient method for Monte Carlo simulations of diffusion-reaction processes. Introduced by us in a previous paper, our algorithm skips the traditional small diffusion hops and propagates the diffusing particles over long distances through a sequence of superhops, one particle at a time. By partitioning the simulation space into nonoverlapping protecting domains each containing only one or two particles, the algorithm factorizes the N -body problem of collisions among multiple Brownian particles into a set of much simpler single-body and two-body problems. Efficient propagation of particles inside their protective domains is enabled through the use of time-dependent Green's functions (propagators) obtained as solutions for the first-passage statistics of random walks. The resulting Monte Carlo algorithm is event-driven and asynchronous; each Brownian particle propagates inside its own protective domain and on its own time clock. The algorithm reproduces the statistics of the underlying Monte Carlo model exactly. Extensive numerical examples demonstrate that for an important class of diffusion-reaction models the algorithm is efficient at low particle densities, where other existing algorithms slow down severely.

UR - http://www.scopus.com/inward/record.url?scp=72449169547&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72449169547&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.80.066701

DO - 10.1103/PhysRevE.80.066701

M3 - Article

C2 - 20365296

AN - SCOPUS:72449169547

VL - 80

JO - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

JF - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

SN - 1063-651X

IS - 6

M1 - 066701

ER -