Hostname: page-component-77f85d65b8-2tv5m Total loading time: 0 Render date: 2026-03-29T13:16:52.498Z Has data issue: false hasContentIssue false

Efficient Sampling in Event-Driven Algorithms for Reaction-Diffusion Processes

Published online by Cambridge University Press:  03 June 2015

Mohammad Hossein Bani-Hashemian*
Affiliation:
Division of Scientific Computing, Department of Information Technology, Uppsala University, P. O. Box 337, SE-75105 Uppsala, Sweden
Stefan Hellander*
Affiliation:
Division of Scientific Computing, Department of Information Technology, Uppsala University, P. O. Box 337, SE-75105 Uppsala, Sweden
Per Lötstedt*
Affiliation:
Division of Scientific Computing, Department of Information Technology, Uppsala University, P. O. Box 337, SE-75105 Uppsala, Sweden
Get access

Abstract

In event-driven algorithms for simulation of diffusing, colliding, and reacting particles, new positions and events are sampled from the cumulative distribution function (CDF) of a probability distribution. The distribution is sampled frequently and it is important for the efficiency of the algorithm that the sampling is fast. The CDF is known analytically or computed numerically. Analytical formulas are sometimes rather complicated making them difficult to evaluate. The CDF may be stored in a table for interpolation or computed directly when it is needed. Different alternatives are compared for chemically reacting molecules moving by Brownian diffusion in two and three dimensions. The best strategy depends on the dimension of the problem, the length of the time interval, the density of the particles, and the number of different reactions.

Information

Type
Research Article
Copyright
Copyright © Global Science Press Limited 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable