RLeapingFast#
RLeapingFast [1] [2] is a solver developed for speeding up the Gillespie (SSA) [3]. In the standard SSA, each reaction is simulated individually. The difference between RLeaping [1] and RLeapingFast [2] is the computation of how many reactions to leap over, which is likely to be quicker with RLeapingFast [2]. This method uses the time step computation developed for tau-leaping [2] and recasts it for use in RLeapingFast. While leaping methods are approximate, they result in faster simulations.
RLeaping can be supplied with four parameters, but we recommend that you do not change the default values unless there is reason to do so. You can speed up the simulation time by increasing epsilon, but the accuracy of the method will decrease.
Parameter |
Data type |
Default |
Description |
---|---|---|---|
solver |
string |
NA |
RF, RFast, and RLeaping are all valid names to run this solver. |
epsilon |
float |
0.01 |
Determines the error of the approximation; accepts values greater than 0 and much less than 1. A value of close to 0 is equivalent to a Gillespie (SSA) simulation and a value close to 1 is the most aggressive speedup (and largest error). We do not recommend changing this value. |
theta |
float |
0 |
Controls the time step selection; accepts values between 0 and 1. A value of 0 is the most conservative and will limit the occurrence of a negative species value. |
sorting interval |
float |
365 |
Sorts the reaction propensities according to this time interval; accepts positive values. To disable sorting, set the sorting interval greater than or equal to the simulation time. |
verbose |
bool |
false |
If true, extra information is printed to the command line, which can be useful for debugging or testing the solver. |
Example#
{
"duration" : 365,
"runs" : 512,
"solver" : "RLeapingFast",
"r-leaping" : {
"epsilon" : 0.01,
"sorting interval" : 365.0,
"verbose" : false
}
}