Accelerated Stochastic Simulation Algorithms

A novel algorithm is proposed for the acceleration of the exact stochastic simulation algorithm by a predefined number of reaction firings (R-leaping) that may occur across several reaction channels. In the present approach, the numbers of reaction firings are correlated binomial distributions and the sampling procedure is independent of any permutation of the reaction channels. This enables the algorithm to efficiently handle large systems with disparate rates, providing substantial computational savings in certain cases. Several mechanisms for controlling the accuracy and the appearance of negative species are described. The advantages and drawbacks of R-leaping are assessed by simulations on a number of benchmark problems and the results are discussed in comparison with established methods.

We propose a novel, accelerated algorithm for the approximate stochastic simulation of biochemical systems with delays. The present work extends existing accelerated algorithms by distributing, in a time adaptive fashion, the delayed reactions so as to minimize the computational effort while preserving their accuracy. The accuracy of the present algorithm is assessed by comparing its results to those of the corresponding delay differential equations for a representative biochemical system. In addition, the fluctuations produced from the present algorithm are comparable to those from an exact stochastic simulation with delays. The algorithm is used to simulate biochemical systems that model oscillatory gene expression. The results indicate that the present algorithm is competitive with existing works for several benchmark problems while it is orders of magnitude faster for certain systems of biochemical reactions.

Stochastic simulations of reaction{–}diffusion processes are used extensively for the modeling of complex systems in areas ranging from biology and social sciences to ecosystems and materials processing. These processes often exhibit disparate scales that render their simulation prohibitive even for massive computational resources. The problem is resolved by introducing a novel stochastic multiresolution method that enables the efficient simulation of reaction{–}diffusion processes as modeled by many-particle systems. The proposed method quantifies and efficiently handles the associated stiffness in simulating the system dynamics and its computational efficiency and accuracy are demonstrated in simulations of a model problem described by the Fisher{–}Kolmogorov equation. The method is general and can be applied to other many-particle models of physical processes.

We present an algorithm for Adaptive Mesh Refinement applied to mesoscopic stochastic simulations of spatially evolving reaction-diffusion processes. The transition rates for the diffusion process are derived on adaptive, locally refined structured meshes. Convergence of the diffusion process is presented and the fluctuations of the stochastic process are verified. Furthermore, a refinement criterion is proposed for the evolution of the adaptive mesh. The method is validated in simulations of reaction-diffusion processes as described by the Fisher-Kolmogorov and Gray-Scott equations.

We propose a novel, accelerated algorithm for the approximate stochastic simulation of biochemical systems with delays. The present work extends existing accelerated algorithms by distributing, in a time adaptive fashion, the delayed reactions so as to minimize the computational effort while preserving their accuracy. The accuracy of the present algorithm is assessed by comparing its results to those of the corresponding delay differential equations for a representative biochemical system. In addition, the fluctuations produced from the present algorithm are comparable to those from an exact stochastic simulation with delays. The algorithm is used to simulate biochemical systems that model oscillatory gene expression. The results indicate that the present algorithm is competitive with existing works for several benchmark problems while it is orders of magnitude faster for certain systems of biochemical reactions.

Stochastic simulations of reaction{–}diffusion processes are used extensively for the modeling of complex systems in areas ranging from biology and social sciences to ecosystems and materials processing. These processes often exhibit disparate scales that render their simulation prohibitive even for massive computational resources. The problem is resolved by introducing a novel stochastic multiresolution method that enables the efficient simulation of reaction{–}diffusion processes as modeled by many-particle systems. The proposed method quantifies and efficiently handles the associated stiffness in simulating the system dynamics and its computational efficiency and accuracy are demonstrated in simulations of a model problem described by the Fisher{–}Kolmogorov equation. The method is general and can be applied to other many-particle models of physical processes.

Spatial distributions characterize the evolution of reaction-diffusion models of several physical, chemical, and biological systems. We present two novel algorithms for the efficient simulation of these models: Spatial tau-Leaping (S tau-Leaping), employing a unified acceleration of the stochastic simulation of reaction and diffusion, and Hybrid tau-Leaping (H tau-Leaping), combining a deterministic diffusion approximation with a tau-Leaping acceleration of the stochastic reactions. The algorithms are validated by solving Fisher’s equation and used to explore the role of the number of particles in pattern formation. The results indicate that the present algorithms have a nearly constant time complexity with respect to the number of events (reaction and diffusion), unlike the exact stochastic simulation algorithm which scales linearly.

A novel algorithm is proposed for the acceleration of the exact stochastic simulation algorithm by a predefined number of reaction firings (R-leaping) that may occur across several reaction channels. In the present approach, the numbers of reaction firings are correlated binomial distributions and the sampling procedure is independent of any permutation of the reaction channels. This enables the algorithm to efficiently handle large systems with disparate rates, providing substantial computational savings in certain cases. Several mechanisms for controlling the accuracy and the appearance of negative species are described. The advantages and drawbacks of R-leaping are assessed by simulations on a number of benchmark problems and the results are discussed in comparison with established methods.