Step
Functions which accept a Spn and return a function for simulating from the transition kernel of that model
Value members
Concrete methods
An Euler-Maruyama simulation of a CLE approximation to the provided Spn.
An Euler-Maruyama simulation of a CLE approximation to the provided Spn.
- Value Params
- dt
The internal time step of the algorithm. Not the same as the
deltatof the returned transition kernel.- n
A
Spn[DoubleState]model (note that the state must be continous)
- Returns
A function with type signature
(x0: DoubleState, t0: Time, deltat: Time) => DoubleStatewhich will simulate the state of the system at timet0+deltatgiven initial statex0and intial timet0
A simple Euler integration of the continuous deterministic approximation to the provided Spn.
Euler methods are well-known to be very unstable, but the function can be useful for getting
a basic idea of how the model behaves in the absence of noise.
A simple Euler integration of the continuous deterministic approximation to the provided Spn.
Euler methods are well-known to be very unstable, but the function can be useful for getting
a basic idea of how the model behaves in the absence of noise.
- Value Params
- dt
The internal time step of the algorithm. Not the same as the
deltatof the returned transition kernel.- n
A
Spn[DoubleState]model (note that the state must be continous)
- Returns
A function with type signature
(x0: DoubleState, t0: Time, deltat: Time) => DoubleStatewhich will simulate the state of the system at timet0+deltatgiven initial statex0and intial timet0
The Gillespie algorithm, sometimes known as the direct method, or the stochastic simulation algorithm (SSA)
The Gillespie algorithm, sometimes known as the direct method, or the stochastic simulation algorithm (SSA)
- Value Params
- maxH
Threshold for terminating simulation early
- minH
Threshold for treating hazard as zero
- n
A
Spn[IntState]model
- Returns
A function with type signature
(x0: IntState, t0: Time, deltat: Time) => IntStatewhich will simulate the state of the system at timet0+deltatgiven initial statex0and intial timet0
A Poisson time-stepping algorithm. Like a tau-leaping algorithm, but with fixed step sizes.
A Poisson time-stepping algorithm. Like a tau-leaping algorithm, but with fixed step sizes.
- Value Params
- dt
The internal time step of the algorithm. Not the same as the
deltatof the returned transition kernel.- n
A
Spn[IntState]model
- Returns
A function with type signature
(x0: IntState, t0: Time, deltat: Time) => IntStatewhich will simulate the state of the system at timet0+deltatgiven initial statex0and intial timet0