HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks
Abstract
This paper introduces HRSSA (Hybrid Rejectionbased Stochastic Simulation Algorithm), a new efficient hybrid stochastic simulation algorithm for spatially homogeneous biochemical reaction networks. HRSSA is built on top of RSSA, an exact stochastic simulation algorithm which relies on propensity bounds to select next reaction firings and to reduce the average number of reaction propensity updates needed during the simulation. HRSSA exploits the computational advantage of propensity bounds to manage timevarying transition propensities and to apply dynamic partitioning of reactions, which constitute the two most significant bottlenecks of hybrid simulation. A comprehensive set of simulation benchmarks is provided for evaluating performance and accuracy of HRSSA against other state of the art algorithms.
 Authors:
 The Microsoft Research – University of Trento Centre for Computational and Systems Biology (COSBI), Piazza Manifattura, 1, 38068 Rovereto (Italy)
 (Italy)
 Publication Date:
 OSTI Identifier:
 22572337
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Journal of Computational Physics; Journal Volume: 317; Other Information: Copyright (c) 2016 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.; Country of input: International Atomic Energy Agency (IAEA)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ACCURACY; ALGORITHMS; BENCHMARKS; BIOLOGY; PARTITION; PERFORMANCE; SIMULATION; STOCHASTIC PROCESSES
Citation Formats
Marchetti, Luca, Email: marchetti@cosbi.eu, Priami, Corrado, Email: priami@cosbi.eu, University of Trento, Department of Mathematics, and Thanh, Vo Hong, Email: vo@cosbi.eu. HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks. United States: N. p., 2016.
Web. doi:10.1016/J.JCP.2016.04.056.
Marchetti, Luca, Email: marchetti@cosbi.eu, Priami, Corrado, Email: priami@cosbi.eu, University of Trento, Department of Mathematics, & Thanh, Vo Hong, Email: vo@cosbi.eu. HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks. United States. doi:10.1016/J.JCP.2016.04.056.
Marchetti, Luca, Email: marchetti@cosbi.eu, Priami, Corrado, Email: priami@cosbi.eu, University of Trento, Department of Mathematics, and Thanh, Vo Hong, Email: vo@cosbi.eu. 2016.
"HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks". United States.
doi:10.1016/J.JCP.2016.04.056.
@article{osti_22572337,
title = {HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks},
author = {Marchetti, Luca, Email: marchetti@cosbi.eu and Priami, Corrado, Email: priami@cosbi.eu and University of Trento, Department of Mathematics and Thanh, Vo Hong, Email: vo@cosbi.eu},
abstractNote = {This paper introduces HRSSA (Hybrid Rejectionbased Stochastic Simulation Algorithm), a new efficient hybrid stochastic simulation algorithm for spatially homogeneous biochemical reaction networks. HRSSA is built on top of RSSA, an exact stochastic simulation algorithm which relies on propensity bounds to select next reaction firings and to reduce the average number of reaction propensity updates needed during the simulation. HRSSA exploits the computational advantage of propensity bounds to manage timevarying transition propensities and to apply dynamic partitioning of reactions, which constitute the two most significant bottlenecks of hybrid simulation. A comprehensive set of simulation benchmarks is provided for evaluating performance and accuracy of HRSSA against other state of the art algorithms.},
doi = {10.1016/J.JCP.2016.04.056},
journal = {Journal of Computational Physics},
number = ,
volume = 317,
place = {United States},
year = 2016,
month = 7
}

Traditional momentclosure methods need to assume that highorder cumulants of a probability distribution approximate to zero. However, this strong assumption is not satisfied for many biochemical reaction networks. Here, we introduce convergent moments (defined in mathematics as the coefficients in the Taylor expansion of the probabilitygenerating function at some point) to overcome this drawback of the momentclosure methods. As such, we develop a new analysis method for stochastic chemical kinetics. This method provides an accurate approximation for the master probability equation (MPE). In particular, the connection between loworder convergent moments and rate constants can be more easily derived in termsmore »

Efficient rejectionbased simulation of biochemical reactions with stochastic noise and delays
We propose a new exact stochastic rejectionbased simulation algorithm for biochemical reactions and extend it to systems with delays. Our algorithm accelerates the simulation by precomputing reaction propensity bounds to select the next reaction to perform. Exploiting such bounds, we are able to avoid recomputing propensities every time a (delayed) reaction is initiated or finished, as is typically necessary in standard approaches. Propensity updates in our approach are still performed, but only infrequently and limited for a small number of reactions, saving computation time and without sacrificing exactness. We evaluate the performance improvement of our algorithm by experimenting with concretemore » 
Hybrid discrete/continuum algorithms for stochastic reaction networks
Direct solutions of the Chemical Master Equation (CME) governing Stochastic Reaction Networks (SRNs) are generally prohibitively expensive due to excessive numbers of possible discrete states in such systems. To enhance computational efficiency we develop a hybrid approach where the evolution of states with low molecule counts is treated with the discrete CME model while that of states with large molecule counts is modeled by the continuum FokkerPlanck equation. The FokkerPlanck equation is discretized using a 2nd order finite volume approach with appropriate treatment of flux components to avoid negative probability values. The numerical construction at the interface between the discretemore »Cited by 3 
Hybrid discrete/continuum algorithms for stochastic reaction networks
Direct solutions of the Chemical Master Equation (CME) governing Stochastic Reaction Networks (SRNs) are generally prohibitively expensive due to excessive numbers of possible discrete states in such systems. To enhance computational efficiency we develop a hybrid approach where the evolution of states with low molecule counts is treated with the discrete CME model while that of states with large molecule counts is modeled by the continuum Fokker–Planck equation. The Fokker–Planck equation is discretized using a 2nd order finite volume approach with appropriate treatment of flux components. The numerical construction at the interface between the discrete and continuum regions implements themore »