Professional Documents
Culture Documents
Stochastic Systems
$
Many systems driven by random, discrete
interactions
Traditional deterministic models may not
accurately describe such systems
Outline
Deterministic rate reaction model
Gillespie method
Examples
Lambda phage
Epidemiology
Optimizations
Deterministic Model
Reactions:
A+B
C
A
C
k1
k2
k3
k4
C
A+B
B
ODEs:
dA/dt = -k1*A*B + k2*C k3*A
dB/dt = -k1*A*B + k2*C + k3*A
dC/dt = k1*A*B k2*C - k4*C
Problem Statement
**
**
**
Deterministic Solution
2000
A+B
C
A
C
C
A+B
B
A
B
C
1500
1000
500
0
0
5
t
Continuous
Average kinetic rates represent
reaction probabilities
10
1000
800
600
A
B
C
400
200
0
0
6
t
10
6
4
2
0
0
200
400
t
600
800
10
8
A
B
C
6
4
2
0
0
200
400
t
600
800
Reaction Probabilities
c dt = average probability that a particular combination
of reactants will react according to R in the next
time interval dt
h = number of reactant combinations
hc dt = a dt = average probability that an R
reaction will occur somewhere inside V
in the next time interval dt
Reaction Probabilities
c dt = average probability that a particular combination
of reactants will react according to R in the next
time interval dt
h = number of reactant combinations
hc dt = a dt = average probability that an R
reaction will occur somewhere inside V
in the next time interval dt
R1: A + B
X molecules of A
Y molecules of B
h1 = XY reactant combinations
t+
t++d
R1:
R2:
R3:
R4:
A+B
C
C
A+B
A
B
C
t+
C 8
t+
t++d
t
=
t+
P0 ( ) = 1 i =1 hi ci
M
hi ci
hi ci
= e i=1
= lim 1 i =1
K
K
hi ci
i =1
RM
= a e a0
= a0 e
a0
aM
a0
= P ( ) P ( )
when
next
reaction
occurs
which
reaction
occurs
R3
a3
a0 =
R2
a2
R1
a1
=1
hi ci
i =1
RM
= a e a0
= a0 e
a0
aM
a0
= P ( ) P ( )
when
next
reaction
occurs
which
reaction
occurs
R3
a3
a0 =
R2
a2
R1
a1
= (1/a0)ln(1/rand1)
is the integer for which
1
i =1
rand2a0
a
i =1
Regulatory circuit
exploits stochastic
noise to produce
different outcomes
Stochastic model
can predict
statistics of
regulatory
outcomes
Epidemiology Example
Infected
Recovered
Susceptible
**
**
**
700
0
50
100
150
200
100
50
100
150
200
4400
4200
0
200
# recovered
0
4600
# susceptibles
800
900
# infected
# susceptibles
200
# recovered
# infected
900
50
100
t (weeks)
150
200
800
700
0
50
100
150
200
50
100
150
200
50
100
t (weeks)
150
200
100
0
4600
4400
4200
0
Disadvantages
CPU intensive
typically must simulate many runs
must use good random number generator
periodicity affects size of simulation
resolution limits range of probabilities
Computational Requirements
Memory (N + 2M + 1)
N species populations
c and a values for each of M reactions; a0
O(M)
O(M)
O(M)
1
i =1
aM
a3
a0 =
a2
rand2a0
a1
a
i =1
Conclusion
Provides means of studying role of noise in
complex systems
Can predict statistics (Lambda phage)
Can depict behavior that deterministic
simulations do not capture (epidemiology
example)
Enhancing performance an active area of
investigation
Implementations
STOCKS: http://www.sysbio.pl/stocks/stocks1.html
BioNetS: https://users.biospice.org/toolsumm.php?id=2
http://www.staff.ncl.ac.uk/d.j.wilkinson/software/
Algorithms/optimizations
D.T. Gillespie. A General Method for Numerically Simulating the Stochastic Time Evolution of Coupled
Chemical Reactions. 1976. J Comput Phys 22:403-434.
D.T. Gillespie. Exact Stochastic Simulation of Coupled Chemical Reactions. 1977. J Phys Chem 81:23402361
M.A. Gibson and J. Bruck. 2000. Efficient Exact Stochastic Simulation of Chemical Systems with Many
Species and Many Channels. J Phys Chem 104:1876-1889
D.T. Gillespie. 2001. Approximate accelerated stochastic simulation of chemically reacting systems. J.
Chem. Phys. 115:1716-1733.
Y. Cao, H. Li and L. Petzold, Efficient formulation of the stochastic simulation algorithm for chemically
reacting system. 2004. J Chem Phys 121:4059-4067
Y. Cao, D. Gillespie, L. Petzold, The slow-scale stochastic simulation algorithm. 2005. J Chem Phys 122(1).
A. Chatterjee and D.G. Vlachos. Binomial distribution based -leap accelerated stochastic simulation. 2005.
J Chem Phys 122:024112
Example Uses
Acknowledgements
Ron Weiss and the
Weiss group
PICASso
Steven Kleinstein
J.P. Singh
S1 + S2 2S1
x1
= k1 x1 x2
t
x2
= k1 x1 x2
t
k 1=
x1 x2 c1V
x1 x2
Deterministic assumption:
k 1= c1V
Master equation
M
P( X 1 ,..., X N ; t ) = =1 [B a P( X 1 ,..., X N ; t )]
t
B dt = probability that single R reaction brings us to state
X1,,XN
a dt = hc dt , where h is the number of reactant
combinations
Often difficult to solve analytically and even numerically