Efficient kinetic Monte Carlo method for reaction-diffusion processes with spatially varying annihilation rates
arXiv:1206.2203 · doi:10.1016/j.jcp.2012.11.036
Abstract
We present an efficient Monte Carlo method to simulate reaction-diffusion processes with spatially varying particle annihilation or transformation rates as it occurs for instance in the context of motor-driven intracellular transport. Like Green's function reaction dynamics and first-passage time methods, our algorithm avoids small diffusive hops by propagating sufficiently distant particles in large hops to the boundaries of protective domains. Since for spatially varying annihilation or transformation rates the single particle diffusion propagator is not known analytically, we present an algorithm that generates efficiently either particle displacements or annihilations with the correct statistics, as we prove rigorously. The numerical efficiency of the algorithm is demonstrated with an illustrative example.
13 pages, 5 figures
References in corpus (1)
Cited by in corpus (6)
- A First-Passage Kinetic Monte Carlo Method for Reaction-Drift-Diffusion Processes
- Optimality of spatially inhomogeneous search strategies
- Numerical analysis of homogeneous and inhomogeneous intermittent search strategies
- The narrow escape problem in a circular domain with radial piecewise constant diffusivity
- Narrow escape problem in two-shell spherical domains
- On the formalization of Asynchronous First Passage Algorithms