Nested Stochastic Simulation Algorithm for KMC with Multiple Time-Scales
|
|
- Gyles Poole
- 5 years ago
- Views:
Transcription
1 Nested Stochastic Simulation Algorithm for KMC with Multiple Time-Scales Eric Vanden-Eijnden Courant Institute Join work with Weinan E and Di Liu
2 Chemical Systems: Evolution of an isothermal, spatially homogeneous mixture of chemically reacting molecules contained in a fixed volume V. N S species of molecules S i, i = 1,..., N S involved in M R reactions R j, j = 1,..., M R. Let x i be the number of molecules of species S i. Each reaction R j is characterized by a rate function a j (x) and a state change (or stochiometric) vector ν j : R j = (a j, ν j ), R = {R 1,..., R MR }.
3 Continuous-time Markov Chain: Given state x = (x 1,..., x NS ), the occurrences of the reactions on an infinitesimal time interval dt are independent of each other and the probability for reaction R j to happen during this time interval is given by a j (x)dt. The state of the system after reaction R j is x + ν j. Equivalently: Given that the state of the system is X t = x at time t; 1. The probability that the next reaction happens after time t+s is e a(x)s where a(x) = M R j=1 a j(x). 2. Given that a reaction happens at time t + s, the probability that it be reaction j is a j (x)/a(x).
4 Gillespie s Stochastic Simulation Algorithm (SSA, aka BKL): D. T. Gillespie, J. Comp. Phys. 22, 403 (1976) A. B. Bortz, M. H. Kalos and J. L. Lebowitz, J. Comp. Phys. 17, 10 (1975) Assume that the system is at state X n at time t n, then: 1. Generate two independent random numbers r 1 and r 2 with uniform distribution on the unit interval (0, 1]. Let δt n+1 = ln r 1 a(x n ), and k n+1 be the natural number such that (a 0 = 0) 1 a(x n ) k n+1 1 j=0 a j (X n ) < r 2 1 a(x n ) k n+1 j=0 a j (X n ), 2. Update the time and the state of the system by Then repeat. t n+1 = t n + δt n+1, X n+1 = X n + ν kn+1. Exact realization of the process X t
5 Systems with two disparate time scales.: Assume that the reactions can be grouped as R s = {(a s (x), ν s )}, (Slow reactions) R f = {(ε 1 a f (x), ν f )} (Fast reactions) where ε 1 represents the ratio of time scales of the system. Then: The time-step between reactions is O(ε) and with probability 1 O(ε) a fast reaction happens. Difficult to simulate the evolution up to the O(1) time-scale of the slow reactions! Several recent works on this topic e.g. by E. L. Haseltine and J. B. Rawlings, J. of Chem. Phys., (2002); C. V. Rao and A. P. Akin J. of Chem. Phy. 118, (2003); Y. Cao, D. Gillespie, and L. Petzold, J. Chem. Phys. 122, (2005); A. Samant and D. G. Vlachos J. Chem. Phys. 123, (2005).
6 Simple example: with a S 1 1 S 2 a2 }{{} fast a, S 3 2 S 3 a4 }{{} slow a 1 = 10 5 x 1, ν 1 = ( 1, +1, 0, 0), a 2 = 10 5 x 2, ν 2 = (+1, 1, 0, 0), a 3 = x 2, ν 3 = ( 0, 1, +1, 0), a 4 = x 3, ν 4 = ( 0, +1, 1, 0), a 5 = 10 5 x 3, ν 5 = ( 0, 0, 1, +1), a 6 = 10 5 x 4, ν 6 = ( 0, 0, +1, 1). a S 5 3 S 4 a6 }{{} fast i.e. the first and third reactions are faster than the second one.. Every species is involved in at least one fast reaction so there is no slow species. But the variables y 1 = x 1 + x 2 and y 2 = x 3 + x 4 are conserved during the fast reactions and only evolve during the slow reaction.
7 x 1 +x 2 x 3 12 molecules time x 10!3 Fig. 1. Evolution of slow variable y 1 = x 1 + x 2 and fast variable x 3 on the intermediate time scale. Evolution of slow variable y 1 = x 1 + x 2 and 2.2 Effective fast dynamics variable onxthe 3 on slowthe time intermediate scale time scale. For the kind of systems discussed above, very often we are interested mostly in
8 Solution: Nested Stochastic Simulation Algorithm: W. E, D. Liu, and E. V.-E., J. Chem Phys. in press; J. Comp Phys. submitted Inner SSA: Run N independent replicas of SSA with the fast reactions R f = {(ε 1 a f, ν f })} only, for a time interval of T 0 + T f. During this calculation, compute the modified slow rates from ã s j = 1 N N k=1 1 T f Tf +T 0 T 0 a s j (Xk τ )dτ, j = 1,, M RS where X k τ is the result of the k-th replica of this auxiliary virtual fast process at virtual time τ whose initial value is X k t=0 = X n. Outer SSA: Run one step of SSA for the modified slow reactions R s = (ã s, ν s ) to generate (t n+1, X n+1 ) from (t n, X n ). Then repeat. Totally seamless!
9 Justification: Averaging theorem for Markov chains. Consider the u(x, t) = E x f(x t ), where X t is the state variable at time t, and E x denotes expectation conditional on X t=0 = x. Then sup 0 t T u(x, t) ū(x, t) = O(ε) Here ū(x, t) = E x f( X t ), where X t is the process generated by: R = {( ā j (x) = )} a s j (x )µ y(x) (x ), νj s x j=1,...,m RS where µ y(x) (x ) is the equilibrium distribution of the virtual fast process, i.e. the original process where only the fast reactions are kept and X t=0 = x.
10 u(x, t) = E x f(x t ) satisfies the backward Kolomogorov equation: u(x, t) t = M R j=1 a j (x) ( u(x + ν j, t) u(x, t) ) (Lu)(x, t) = ε 1 (L 1 u)(x, t) + (L 0 u)(x, t) Singular perturbation analysis of this equation (Khasminskii,...). Key observations: (i) the slow variables coincide with the maximum ergodic components of the process associated with L 1 ; (ii) they are given by y k = b k x for k = 1,..., K, where {b 1,..., b K } form a basis of the linear subspace such that b ν f j = 0 for all νf j ; and (iii) if x and x belong to the same ergodic component, then x + ν s j and x + ν s j also belong to the same ergodic component for all ν s j.
11 Simple example revisited a S 1 1 S 2 a2 }{{} fast a, S 3 2 S 3 a4 }{{} slow a S 5 3 S 4 a6 }{{} fast. Slow variables: y 1 = x 1 + x 2, y 2 = x 3 + x 4 Equilibrium distribution of the virtual fast process: µ y1,y 2 (x 1, x 2, x 3, x 4 ) = y 1! y 2! x 1! x 2! x 3! x 4! (1/2)y 1(1/2) y 2δ x1 +x 2 =y 1 δ x3 +x 4 =y 2. Effective dynamics: ā s 3 = P x 2 = x 1 + x 2 2 ā s 4 = P x 3 = x 3 + x 4 2 = y 1 2, νs 3 = y 2 2, νs 4 = ( 1, +1), = (+1, 1).
12 x 1 +x 2 x 3 +x x 1 +x 2 x 3 Multiscale Methods for Stochastic Dynamical S molecules time x 10!3
13 Error estimate: For any T > 0, there exist constants C and α independent of (N, T 0, T f ) such that, sup 0 t T E v(x, t) u(x, t) C ε + e αt 0/ε 1 + T f /ε + 1 N(1 + Tf /ε). Efficiency: Given an error tolerance λ: cost = O(N(1 + T 0 /ε + T f /ε)) = O ( ) 1 λ 2 (nested SSA) cost = O ( ) 1 ε (direct SSA)
14 Example: Heat shock response of E. Coli Mechanism of protection that the E. Coli bacteria uses to fight against denaturation (unfolding) of its constituent proteins induced by the increase of temperature. Stochastic petri net for heat shock response (from Srivastava et al.) R. Srivastava, M. Peterson and W. Bently, Biotech. Bioeng. 75, 120 (2001) 14 species, 17 reactions
15 Species Initial value DNA.σ 32 1 mrna.σ σ RNAPσ DNA.DnaJ 1 DNA.FtsH 0 DNA.GroEL 1 DnaJ 4640 FtsH 200 GroEL 4314 DnaJ.UnfoldedProtein Protein σ 32.DnaJ 2959 UnfoldedProtein es and their initial value (in number E. Coli proposed in [8]. Figure 3. SPN of the!32 genetic regulatory circuit. All simulations were based on the SPN shown. The arcs made up of dotted lines were for recombinant protein simulations. of the molecules) in the Petri net model of tion, the generic binding constant between the recombinant protein and the J-complex was varied. In this way, predictions of a!32-mediated stress response could be generated. software package for modeling stochastic activi (Sanders, 1995). The ULTRASAN software was vided by Dr. Sanders (Center for Reliable
16 Reaction Rate constant Rates magnitude DNA.σ 32 mrna.σ mrna.σ 32 σ 32 + mrna.σ mrna.σ 32 degradation σ 32 RNAPσ RNAPσ 32 σ σ 32 + DnaJ σ 32.DnaJ ( ) DnaJ degradation ( ) σ 32.DnaJ σ 32 + DnaJ DNA.DnaJ + RNAPσ 32 DnaJ + DNA.DnaJ + σ DNA.FtsH + RNAP.σ 32 FtsH + DNA.FtsH + σ FtsH degradation GroEL degradation σ 32.DnaJ + FtsH DnaJ + FtsH DNA.GroEL + RNAPσ 32 GroEL + DNA.GroEL +σ Protein UnfoldedProtein ( ) DnaJ+ UnfoldedProtein DnaJ.UnfoldedProtein ( ) DnaJ.UnfoldedProtein DnaJ+ UnfoldedProtein ( )
17 Nested SSA allows a speed-up by a factor of 100 in this example without any loss of accuracy %)!! %(&! %(!! +,-./ " 5"!!' 4 " 5"!!% %'&! %'!! %&&! %&!! %%&! %%!! %$&! %$!!! "!! #!! $!! %!! &!! '!! (!! )!! *!! "!!! Shown: Growth rate of GroEL (a protein measuring stress response)
18 (N, T f /10 6 ) (1, 1) (1, 4) (1, 16) (1, 64) (1, 256) (1, 1024) CPU σ var(σ 32 ) TABLE III: Efficiency of nested SSA when N = 1. Since we used N 0 = 1000 realizations of the Outer SSA to compute σ 32 and var(σ 32 ), the statistical errors on these quantities is about 0.1. (N, T f /10 6 ) (1, 1) (2, 2) (4, 4) (8, 8) (16, 16) (32, 32) CPU σ var(σ 32 ) TABLE IV: Efficiency of nested SSA with multiple replicas in the Inner SSA. Again the statistical errors on σ 32 and var(σ 32 ) is about 0.1. T f / CPU
19 or C ε T f /ε + 1 N f (1 + T f /ε) N uf (1 + T uf /ε ) Generalization: 1 Nested + T uf /ε 2 SSA with more than two levels: Let us take a look at an example. Consider the (104) following system + 1 Nf (1 + T f /ε) + 1 Nuf (1 + T uf /ε 2 ) a 1 S 1 S 2, S 2 a2 a 3 S 3, S 3 a4 with the reaction rates and state change vectors. e a look at an example. Consider the following system S 1 a 1 S 2, S 2 a2 a 3 S 3, S 3 a4 eaction rates and state change vectors a 5 S 4. (105) a6 a 1 = x 1, ν 1 = 1 ( 1, +1, Nested 0, SSA0), a 2 = x 2, ν 2 = (+1, 1, Direct SSA 0, 0), a 3 = x 2, ν 3 = ( 0, 1, +1, 0), a 4 = x 3, ν 4 = ( 0, +1, 1, 0), (106) a 5 = x 3, ν = ( 0, 0, 1, +1), a 6 = x 4, ν 6 = ( 0, 0, +1, 1). a 1 = x 1, ν 1 = ( 1, +1, 0, 0), a 2 = x 2, ν 2 = (+1, 1, 0, 0), a 3 = 10 5 x 2, ν 3 = ( 0, 1, +1, 0), a 4 = x 3, ν 4 = ( 0, +1, 1, 0), a 5 = x 3, ν 5 = ( 0, 0, 1, +1), a 6 = x 4, ν 6 = ( 0, 0, +1, 1). Empirical distribution 0.2 a 5 a6 S 4. (105) (106) x1 x2 x3 x4 Fig. 6. Empirical distributions obtained by nested SSA and direct SSA cost. The distribution produced by nested SSA is nearly exact, wher produced by direct SSA is totally inaccurate. results:
20 SSA to pick up the set of fast reactions dynamically. Consider the following system: Generalization: Adaptive nested SSA: Fig. 3. Time evolutiona 1 of the reaction rates a S a 32 and a 5 + a 6 S 2, S 2 a2 S 3, 2S 2 + S 3 a4 eaction rates and the state change vectors are Fig. 3. Time evolution of the reaction rates a 1 + a 2 and a 5 + a 6 The a reaction 1 = x 1, rates and the state change ν 1 = vectors ( 1, +1, are 0, 0), a 2 = x 2, ν 2 = (+1, 1, 0, 0), 23 a 3 = 10 4 ax 12 =, x 1, ν 3 = (0, ν 1, 1 = +1, ( 1, 0), +1, 0, 0), a 4 = 10 4 (96) ax 23 =, x 2, ν 4 = (0, ν+1, 2 = 1, (+1, 0), 1, 0, 0), a 5 = 2x 2 a(x 3 = )x 4 x 23, ν 5 = ( 0, ν 2, 3 = 1, (0, +3), 1, +1, 0), a 6 = 2x 4 a(x 4 = )(x 4 x 3, 4 2), ν 6 = ( 0, ν+2, 4 = +1, (0, 3). +1, 1, 0), a 5 = 2x 2 (x 2 1)x 3, ν 5 = ( 0, 2, 1, +3), se that we start with the following initial condition: a 6 = 2x 4 (x 4 1)(x 4 2), ν 6 = ( 0, +2, +1, 3). (x 1, x 2, x 3, x 3 ) = (100, 3, 3, 3). (97) Suppose that we start with the following initial condition: (96) e beginning, when the concentration of S 2 is low, only the transition en S 2 Initial and S 3 data: (x is fast. As the 1, x number 2, x 3, x of 3 ) = (100, 3, 3, 3). (97) S 2 grows, the last two reactions e faster and faster. Figure 5 shows the evolution of the sum of the At the beginning, when the concentration of S on rates a 1 + a 2 and a 5 + a 6. It can be seen that the 2 is low, only the transition reaction rate a 5 + a between S 6 from O(1) to 2 and S O( is fast. As the number of S ) on a time scale of O(1). 2 grows, the last two reactions become faster and faster. Figure 5 shows the evolution of the sum of the t reaction the nested rates SSAa 1 and + a 2 compare and a 5 + itawith 6. It the can direct be seen SSA, thatwe the use reaction the mean rate a 5 + a 6 egrows variance from at time O(1) T to= O(10 4 of x 5 ) 1, on thea number time scale of species of O(1). S 1, as a benchmark. putation of the direct SSA with N 0 = gives To test the nested SSA and compare it with the direct SSA, we use the mean and the variance x 1 = at time ± 0.2, T = 4 var(x of x 1, 1 the ) = number ± of 0.2. species S 1, as a(98) benchmark. a 5 a6 3S 4. (95)
21 A computation A computation of theof direct the direct SSA SSANwith 0 = N 0 = gives gives the ensemble and simulation time of the inner SSA in the nested SSA scheme are chosen to be Direct SSA: x 1 = x 1 = ± , ± 0.2, var(x 1 ) var(x = ) = ± ± 0.2. (98) (98) (N, T f ) = (1, 2 k 10 5 ), (100) The calculation The calculation for different took took values seconds of k = seconds 0, of 1, CPU 2, of.. time.. CPU The ontime error ouron machine. should our machine. be In the Innested the nested SSA, SSA, we dynamically we dynamically change change the set λ = O(2 the of k/2 fast ). set of reactions fast reactions by con-by con-(101) The following table gives 24 the CPU time and the values of the mean and variance of x 1 using N 0 = The 24 sum of the relative errors of the mean and the variance is shown in figure 5. Adaptive Nested SSA: T f / CPU x var(x 1 ) Table 4 Efficiency and accuracy of the adaptive nested SSA. The strategy for adaptively determining the set of fast and slow reactions may not be the best one. Further work in this direction is clearly needed. 25
22 Generalization to other types of KMC Generator (Lf)(x) = j J λ j (x)(f(x + z j (x)) f(x)) Ergodic components of fast process: for any test function f : X R, we have if x X y then lim T 1 T T 0 E xf(x f t )dt = x X µ y (x)f(x), where E x denotes the expectation conditional on X f t=0 = x Assumption: Slow reactions induce an injection on the ergodic components X y, i.e. for each e j, there exists a unique ē j such that for all x X, if x X y then x + e j X yj with y j = y + ē j.
Nested Stochastic Simulation Algorithm for Chemical Kinetic Systems with Disparate Rates. Abstract
Nested Stochastic Simulation Algorithm for Chemical Kinetic Systems with Disparate Rates Weinan E Department of Mathematics and PACM, Princeton University, Princeton, NJ 08544, USA Di Liu and Eric Vanden-Eijnden
More informationEfficient Leaping Methods for Stochastic Chemical Systems
Efficient Leaping Methods for Stochastic Chemical Systems Ioana Cipcigan Muruhan Rathinam November 18, 28 Abstract. Well stirred chemical reaction systems which involve small numbers of molecules for some
More informationExtending the Tools of Chemical Reaction Engineering to the Molecular Scale
Extending the Tools of Chemical Reaction Engineering to the Molecular Scale Multiple-time-scale order reduction for stochastic kinetics James B. Rawlings Department of Chemical and Biological Engineering
More informationComputational methods for continuous time Markov chains with applications to biological processes
Computational methods for continuous time Markov chains with applications to biological processes David F. Anderson anderson@math.wisc.edu Department of Mathematics University of Wisconsin - Madison Penn.
More informationIntroduction to asymptotic techniques for stochastic systems with multiple time-scales
Introduction to asymptotic techniques for stochastic systems with multiple time-scales Eric Vanden-Eijnden Courant Institute Motivating examples Consider the ODE {Ẋ = Y 3 + sin(πt) + cos( 2πt) X() = x
More informationFast Probability Generating Function Method for Stochastic Chemical Reaction Networks
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 71 (2014) 57-69 ISSN 0340-6253 Fast Probability Generating Function Method for Stochastic Chemical Reaction
More informationStochastic Simulation.
Stochastic Simulation. (and Gillespie s algorithm) Alberto Policriti Dipartimento di Matematica e Informatica Istituto di Genomica Applicata A. Policriti Stochastic Simulation 1/20 Quote of the day D.T.
More information1. Introduction Systems evolving on widely separated time-scales represent a challenge for numerical simulations. A generic example is
COMM. MATH. SCI. Vol. 1, No. 2, pp. 385 391 c 23 International Press FAST COMMUNICATIONS NUMERICAL TECHNIQUES FOR MULTI-SCALE DYNAMICAL SYSTEMS WITH STOCHASTIC EFFECTS ERIC VANDEN-EIJNDEN Abstract. Numerical
More informationSlow Scale Tau-leaping Method
Slow Scale Tau-leaping Method Yang Cao Linda Petzold Abstract For chemical systems involving both fast and slow scales, stiffness presents challenges for efficient stochastic simulation. Two different
More informationStochastic Simulation Methods for Solving Systems with Multi-State Species
Stochastic Simulation Methods for Solving Systems with Multi-State Species Zhen Liu Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of
More informationThe Adaptive Explicit-Implicit Tau-Leaping Method with Automatic Tau Selection
The Adaptive Explicit-Implicit Tau-Leaping Method with Automatic Tau Selection Yang Cao Department of Computer Science, 660 McBryde Hall, Virginia Tech, Blacksburg, VA 24061 Daniel T. Gillespie Dan T.
More informationLecture 4 The stochastic ingredient
Lecture 4 The stochastic ingredient Luca Bortolussi 1 Alberto Policriti 2 1 Dipartimento di Matematica ed Informatica Università degli studi di Trieste Via Valerio 12/a, 34100 Trieste. luca@dmi.units.it
More informationSTOCHASTIC CHEMICAL KINETICS
STOCHASTIC CHEICAL KINETICS Dan Gillespie GillespieDT@mailaps.org Current Support: Caltech (NIGS) Caltech (NIH) University of California at Santa Barbara (NIH) Past Support: Caltech (DARPA/AFOSR, Beckman/BNC))
More informationAdaptive Deployment of Model Reductions for Tau-leaping Simulation
Adaptive Deployment of Model Reductions for Tau-leaping Simulation Sheng Wu, 1, a) Jin Fu, 1, b) 1, c) and Linda R. Petzold Department of Computer Science, University of California Santa Barbara, Santa
More informationModelling in Systems Biology
Modelling in Systems Biology Maria Grazia Vigliotti thanks to my students Anton Stefanek, Ahmed Guecioueur Imperial College Formal representation of chemical reactions precise qualitative and quantitative
More informationStochastic models of biochemical systems
Stochastic models of biochemical systems David F. Anderson anderson@math.wisc.edu Department of Mathematics University of Wisconsin - Madison University of Amsterdam November 14th, 212 Stochastic models
More informationStochastic Simulation of the Cell Cycle Model for Budding Yeast. 1 Introduction. Di Liu
Commun. Comput. Phys. doi: 10.4208/cicp.311009.100310a Vol. 9, No. 2, pp. 390-405 February 2011 Stochastic Simulation of the Cell Cycle Model for Budding Yeast Di Liu Department of Mathematics, Michigan
More informationGillespie s Algorithm and its Approximations. Des Higham Department of Mathematics and Statistics University of Strathclyde
Gillespie s Algorithm and its Approximations Des Higham Department of Mathematics and Statistics University of Strathclyde djh@maths.strath.ac.uk The Three Lectures 1 Gillespie s algorithm and its relation
More informationKinetic Monte Carlo. Heiko Rieger. Theoretical Physics Saarland University Saarbrücken, Germany
Kinetic Monte Carlo Heiko Rieger Theoretical Physics Saarland University Saarbrücken, Germany DPG school on Efficient Algorithms in Computational Physics, 10.-14.9.2012, Bad Honnef Intro Kinetic Monte
More informationIntroduction to stochastic multiscale modelling in tumour growth
Introduction to stochastic multiscale modelling in tumour growth Tomás Alarcón ICREA & Centre de Recerca Matemàtica T. Alarcón (ICREA & CRM, Barcelona, Spain) Lecture 3 CIMPA, Santiago de Cuba, June 2016
More informationBiomolecular reaction networks: gene regulation & the Repressilator Phys 682/ CIS 629: Computational Methods for Nonlinear Systems
Biomolecular reaction networks: gene regulation & the Repressilator Phys 682/ CIS 629: Computational Methods for Nonlinear Systems Processing information to coordinate activity regulatory & signaling networks
More informationKinetic Monte Carlo (KMC)
Kinetic Monte Carlo (KMC) Molecular Dynamics (MD): high-frequency motion dictate the time-step (e.g., vibrations). Time step is short: pico-seconds. Direct Monte Carlo (MC): stochastic (non-deterministic)
More informationAvoiding negative populations in explicit Poisson tau-leaping
THE JOURNAL OF CHEMICAL PHYSICS 123, 054104 2005 Avoiding negative populations in explicit Poisson tau-leaping Yang Cao a Department of Computer Science, University of California, Santa Barbara, Santa
More informationBinomial leap methods for simulating stochastic chemical kinetics
Binomial leap methods for simulating stochastic chemical kinetics Tianhai Tian and Kevin Burrage Citation: The Journal of Chemical Physics 121, 10356 (2004); doi: 10.1063/1.1810475 View online: http://dx.doi.org/10.1063/1.1810475
More informationSimulation methods for stochastic models in chemistry
Simulation methods for stochastic models in chemistry David F. Anderson anderson@math.wisc.edu Department of Mathematics University of Wisconsin - Madison SIAM: Barcelona June 4th, 21 Overview 1. Notation
More information2008 Hotelling Lectures
First Prev Next Go To Go Back Full Screen Close Quit 1 28 Hotelling Lectures 1. Stochastic models for chemical reactions 2. Identifying separated time scales in stochastic models of reaction networks 3.
More informationThe slow-scale stochastic simulation algorithm
THE JOURNAL OF CHEICAL PHYSICS 22, 046 2005 The slow-scale stochastic simulation algorithm Yang Cao a) Department of Computer Science, University of California, Santa Barbara, Santa Barbara, California
More informationStatistical mechanics of biological processes
Statistical mechanics of biological processes 1 Modeling biological processes Describing biological processes requires models. If reaction occurs on timescales much faster than that of connected processes
More informationDiffusion and cellular-level simulation. CS/CME/BioE/Biophys/BMI 279 Nov. 7 and 9, 2017 Ron Dror
Diffusion and cellular-level simulation CS/CME/BioE/Biophys/BMI 279 Nov. 7 and 9, 2017 Ron Dror 1 Outline How do molecules move around in a cell? Diffusion as a random walk (particle-based perspective)
More informationStat 516, Homework 1
Stat 516, Homework 1 Due date: October 7 1. Consider an urn with n distinct balls numbered 1,..., n. We sample balls from the urn with replacement. Let N be the number of draws until we encounter a ball
More informationSystem Biology - Deterministic & Stochastic Dynamical Systems
System Biology - Deterministic & Stochastic Dynamical Systems System Biology - Deterministic & Stochastic Dynamical Systems 1 The Cell System Biology - Deterministic & Stochastic Dynamical Systems 2 The
More informationSTOCHASTIC REDUCTION METHOD FOR BIOLOGICAL CHEMICAL KINETICS USING TIME-SCALE SEPARATION
STOCHASTIC REDUCTION METHOD FOR BIOLOGICAL CHEMICAL KINETICS USING TIME-SCALE SEPARATION CHETAN D. PAHLAJANI 12, PAUL J. ATZBERGER 23, AND MUSTAFA KHAMMASH 3 Abstract. Many processes in cell biology encode
More informationProblem Set 5. 1 Waiting times for chemical reactions (8 points)
Problem Set 5 1 Waiting times for chemical reactions (8 points) In the previous assignment, we saw that for a chemical reaction occurring at rate r, the distribution of waiting times τ between reaction
More informationEfficient step size selection for the tau-leaping simulation method
THE JOURNAL OF CHEMICAL PHYSICS 24, 04409 2006 Efficient step size selection for the tau-leaping simulation method Yang Cao a Department of Computer Science, Virginia Tech, Blacksburg, Virginia 2406 Daniel
More informationAn Introduction to Stochastic Simulation
Stephen Gilmore Laboratory for Foundations of Computer Science School of Informatics University of Edinburgh PASTA workshop, London, 29th June 2006 Background The modelling of chemical reactions using
More informationConfidence intervals for the mixing time of a reversible Markov chain from a single sample path
Confidence intervals for the mixing time of a reversible Markov chain from a single sample path Daniel Hsu Aryeh Kontorovich Csaba Szepesvári Columbia University, Ben-Gurion University, University of Alberta
More informationMATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #12
MATH0 Introduction to Analysis (007 Fall and 008 Spring) Tutorial Note #1 Limit (Part ) Recurrence Relation: Type 1: Monotone Sequence (Increasing/ Decreasing sequence) Theorem 1: Monotone Sequence Theorem
More informationA Multiple Time-Step Finite State Projection Algorithm for the Solution to the Chemical Master Equation
A Multiple Time-Step Finite State Projection Algorithm for the Solution to the Chemical Master Equation Brian Munsky and Mustafa Khammash Department of Mechanical and Environmental Engineering University
More informationNumerical Simulation for Biochemical Kinetics
Chapter 1 Numerical Simulation for Biochemical Kinetics Daniel T. Gillespie and Linda R. Petzold In chemical systems formed by living cells, the small numbers of molecules of a few reactant species can
More informationAN INTRODUCTION TO DISCRETE-EVENT SIMULATION
AN INTRODUCTION TO DISCRETE-EVENT SIMULATION Peter W. Glynn 1 Peter J. Haas 2 1 Dept. of Management Science and Engineering Stanford University 2 IBM Almaden Research Center San Jose, CA CAVEAT: WE ARE
More informationComputing on Virtual Slow Manifolds of Fast Stochastic Systems.
European Society of Computational Methods in Sciences and Engineering (ESCMSE) Journal of Numerical Analysis, Industrial and Applied Mathematics (JNAIAM) vol. 1, no. 1, nnnn, pp. 1-3 ISSN 179 814 Computing
More information56:198:582 Biological Networks Lecture 8
56:198:582 Biological Networks Lecture 8 Course organization Two complementary approaches to modeling and understanding biological networks Constraint-based modeling (Palsson) System-wide Metabolism Steady-state
More informationKinetic Monte Carlo (KMC) Kinetic Monte Carlo (KMC)
Kinetic Monte Carlo (KMC) Molecular Dynamics (MD): high-frequency motion dictate the time-step (e.g., vibrations). Time step is short: pico-seconds. Direct Monte Carlo (MC): stochastic (non-deterministic)
More informationCS 781 Lecture 9 March 10, 2011 Topics: Local Search and Optimization Metropolis Algorithm Greedy Optimization Hopfield Networks Max Cut Problem Nash
CS 781 Lecture 9 March 10, 2011 Topics: Local Search and Optimization Metropolis Algorithm Greedy Optimization Hopfield Networks Max Cut Problem Nash Equilibrium Price of Stability Coping With NP-Hardness
More informationExercise Set 4. D s n ds + + V. s dv = V. After using Stokes theorem, the surface integral becomes
Exercise Set Exercise - (a) Let s consider a test volum in the pellet. The substract enters the pellet by diffusion and some is created and disappears due to the chemical reaction. The two contribute to
More informationHomework #3 Solutions
Homework #3 Solutions Math 82, Spring 204 Instructor: Dr. Doreen De eon Exercises 2.2: 2, 3 2. Write down the heat equation (homogeneous) which corresponds to the given data. (Throughout, heat is measured
More informationGeneralization theory
Generalization theory Daniel Hsu Columbia TRIPODS Bootcamp 1 Motivation 2 Support vector machines X = R d, Y = { 1, +1}. Return solution ŵ R d to following optimization problem: λ min w R d 2 w 2 2 + 1
More informationDerivations for order reduction of the chemical master equation
2 TWMCC Texas-Wisconsin Modeling and Control Consortium 1 Technical report number 2006-02 Derivations for order reduction of the chemical master equation Ethan A. Mastny, Eric L. Haseltine, and James B.
More informationIntroduction to multiscale modeling and simulation. Explicit methods for ODEs : forward Euler. y n+1 = y n + tf(y n ) dy dt = f(y), y(0) = y 0
Introduction to multiscale modeling and simulation Lecture 5 Numerical methods for ODEs, SDEs and PDEs The need for multiscale methods Two generic frameworks for multiscale computation Explicit methods
More informationJournal of Computational Physics
Journal of Computational Physics 227 (28) 8672 8684 Contents lists available at ScienceDirect Journal of Computational Physics ournal homepage: www.elsevier.com/locate/cp A numerical scheme for optimal
More informationEnergy Profiles and Chemical Reactions
Energy rofiles and Chemical eactions + B C D E egensburg er-la Norrby Modeling Kinetics Molecular Modeling Stationary points Energies Barriers eaction rates DFT, ab initio, MM Ground & Transition states
More informationJudith Herzfeld 1997,1999. These exercises are provided here for classroom and study use only. All other uses are copyright protected.
Judith Herzfeld 1997,1999 These exercises are provided here for classroom and study use only. All other uses are copyright protected. 5.5-010 Which of the following statements is not valid concerning a
More informationA computational strategy for multiscale chaotic systems with applications to Lorenz 96 model
A computational strategy for multiscale chaotic systems with applications to Lorenz 96 model Ibrahim Fatkullin a, Eric Vanden-Eijnden b,1 a California Institute of Technology, Pasadena, CA 91125, USA b
More informationLecture 7: Simple genetic circuits I
Lecture 7: Simple genetic circuits I Paul C Bressloff (Fall 2018) 7.1 Transcription and translation In Fig. 20 we show the two main stages in the expression of a single gene according to the central dogma.
More informationEE650R: Reliability Physics of Nanoelectronic Devices Lecture 18: A Broad Introduction to Dielectric Breakdown Date:
EE650R: Reliability Physics of Nanoelectronic Devices Lecture 18: A Broad Introduction to Dielectric Breakdown Date: Nov 1, 2006 ClassNotes: Jing Li Review: Sayeef Salahuddin 18.1 Review As discussed before,
More informationStochastic Simulation of Biochemical Reactions
1 / 75 Stochastic Simulation of Biochemical Reactions Jorge Júlvez University of Zaragoza 2 / 75 Outline 1 Biochemical Kinetics 2 Reaction Rate Equation 3 Chemical Master Equation 4 Stochastic Simulation
More informationWhen do diffusion-limited trajectories become memoryless?
When do diffusion-limited trajectories become memoryless? Maciej Dobrzyński CWI (Center for Mathematics and Computer Science) Kruislaan 413, 1098 SJ Amsterdam, The Netherlands Abstract Stochastic description
More information1 of 7 7/16/2009 6:12 AM Virtual Laboratories > 7. Point Estimation > 1 2 3 4 5 6 1. Estimators The Basic Statistical Model As usual, our starting point is a random experiment with an underlying sample
More informationNumerical solution of stochastic models of biochemical kinetics
Numerical solution of stochastic models of biochemical kinetics SILVANA ILIE a WAYNE H. ENRIGHT b KENNETH R. JACKSON b a Department of Mathematics, Ryerson University, Toronto, ON, M5B 2K3, Canada email:
More informationGene regulatory networks: A coarse-grained, equation-free approach to multiscale computation
THE JOURNAL OF CHEMICAL PHYSICS 124, 084106 2006 Gene regulatory networks: A coarse-grained, equation-free approach to multiscale computation Radek Erban a Mathematical Institute, University of Oxford,
More informationAccelerated stochastic simulation of the stiff enzyme-substrate reaction
THE JOURNAL OF CHEMICAL PHYSICS 123, 144917 2005 Accelerated stochastic simulation of the stiff enzyme-substrate reaction Yang Cao a Department of Computer Science, University of California, Santa Barbara,
More information3D Elasticity Theory
3D lasticity Theory Many structural analysis problems are analysed using the theory of elasticity in which Hooke s law is used to enforce proportionality between stress and strain at any deformation level.
More informationin Bounded Domains Ariane Trescases CMLA, ENS Cachan
CMLA, ENS Cachan Joint work with Yan GUO, Chanwoo KIM and Daniela TONON International Conference on Nonlinear Analysis: Boundary Phenomena for Evolutionnary PDE Academia Sinica December 21, 214 Outline
More informationSTOCHASTIC PROCESSES Basic notions
J. Virtamo 38.3143 Queueing Theory / Stochastic processes 1 STOCHASTIC PROCESSES Basic notions Often the systems we consider evolve in time and we are interested in their dynamic behaviour, usually involving
More informationStochastic Modeling of Chemical Reactions
Stochastic Modeling of Chemical Reactions Eric Haseltine Department of Chemical Engineering University of Wisconsin-Madison TWMCC 27 September Texas-Wisconsin Modeling and Control Consortium 22TWMCC Outline
More informationFinite temperature analysis of stochastic networks
Finite temperature analysis of stochastic networks Maria Cameron University of Maryland USA Stochastic networks with detailed balance * The generator matrix L = ( L ij ), i, j S L ij 0, i, j S, i j j S
More informationCell Cycle Modeling for Budding Yeast with Stochastic Simulation Algorithms
Cell Cycle Modeling for Budding Yeast with Stochastic Simulation Algorithms Tae-Hyuk Ahn 1, Layne T Watson 1,2, Yang Cao 1, Clifford A Shaffer 1, and William T Baumann 3 1 Department of Computer Science,
More informationPh.D. Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2) EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified.
PhD Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2 EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified Problem 1 [ points]: For which parameters λ R does the following system
More informationPattern Recognition and Machine Learning. Bishop Chapter 11: Sampling Methods
Pattern Recognition and Machine Learning Chapter 11: Sampling Methods Elise Arnaud Jakob Verbeek May 22, 2008 Outline of the chapter 11.1 Basic Sampling Algorithms 11.2 Markov Chain Monte Carlo 11.3 Gibbs
More informationDETERMINATION OF MODEL VALID PREDICTION PERIOD USING THE BACKWARD FOKKER-PLANCK EQUATION
.4 DETERMINATION OF MODEL VALID PREDICTION PERIOD USING THE BACKWARD FOKKER-PLANCK EQUATION Peter C. Chu, Leonid M. Ivanov, and C.W. Fan Department of Oceanography Naval Postgraduate School Monterey, California.
More informationIntroduction to Random Diffusions
Introduction to Random Diffusions The main reason to study random diffusions is that this class of processes combines two key features of modern probability theory. On the one hand they are semi-martingales
More informationProblems on Evolutionary dynamics
Problems on Evolutionary dynamics Doctoral Programme in Physics José A. Cuesta Lausanne, June 10 13, 2014 Replication 1. Consider the Galton-Watson process defined by the offspring distribution p 0 =
More informationCompeting sources of variance reduction in parallel replica Monte Carlo, and optimization in the low temperature limit
Competing sources of variance reduction in parallel replica Monte Carlo, and optimization in the low temperature limit Paul Dupuis Division of Applied Mathematics Brown University IPAM (J. Doll, M. Snarski,
More informationMarkov Chain Monte Carlo Inference. Siamak Ravanbakhsh Winter 2018
Graphical Models Markov Chain Monte Carlo Inference Siamak Ravanbakhsh Winter 2018 Learning objectives Markov chains the idea behind Markov Chain Monte Carlo (MCMC) two important examples: Gibbs sampling
More informationNumerical methods in molecular dynamics and multiscale problems
Numerical methods in molecular dynamics and multiscale problems Two examples T. Lelièvre CERMICS - Ecole des Ponts ParisTech & MicMac project-team - INRIA Horizon Maths December 2012 Introduction The aim
More informationHomework 2. Due Friday, July We studied the logistic equation in class as a model of population growth. It is given by dn dt = rn 1 N
Problem 1 (10 points) Homework Due Friday, July 7 017 We studied the logistic equation in class as a model of population growth. It is given by dn dt = rn 1 N, (1) K with N(0) = N 0. (a) Make the substitutions
More informationMultiscale stochastic simulation algorithm with stochastic partial equilibrium assumption for chemically reacting systems
Journal of Computational Physics 206 (2005) 395 411 www.elsevier.com/locate/jcp Multiscale stochastic simulation algorithm with stochastic partial equilibrium assumption for chemically reacting systems
More informationChemical Equilibrium: A Convex Optimization Problem
Chemical Equilibrium: A Convex Optimization Problem Linyi Gao June 4, 2014 1 Introduction The equilibrium composition of a mixture of reacting molecules is essential to many physical and chemical systems,
More informationNotes for Math 450 Stochastic Petri nets and reactions
Notes for Math 450 Stochastic Petri nets and reactions Renato Feres Petri nets Petri nets are a special class of networks, introduced in 96 by Carl Adam Petri, that provide a convenient language and graphical
More informationTractability of Multivariate Problems
Erich Novak University of Jena Chemnitz, Summer School 2010 1 Plan for the talk Example: approximation of C -functions What is tractability? Tractability by smoothness? Tractability by sparsity, finite
More informationFrom cell biology to Petri nets. Rainer Breitling, Groningen, NL David Gilbert, London, UK Monika Heiner, Cottbus, DE
From cell biology to Petri nets Rainer Breitling, Groningen, NL David Gilbert, London, UK Monika Heiner, Cottbus, DE Biology = Concentrations Breitling / 2 The simplest chemical reaction A B irreversible,
More informationFirst passage time Markov chain analysis of rare events for kinetic Monte Carlo: double kink nucleation during dislocation glide
INSTITUTE OF PHYSICS PUBLISHING MODELLING AND SIMULATION IN MATERIALS SCIENCE AND ENGINEERING Modelling Simul. Mater. Sci. Eng. 10 (2002) 581 596 PII: S0965-0393(02)39232-5 First passage time Markov chain
More informationOn the Interpretation of Delays in Delay Stochastic Simulation of Biological Systems
On the Interpretation of Delays in Delay Stochastic Simulation of Biological Systems Roberto Barbuti Giulio Caravagna Andrea Maggiolo-Schettini Paolo Milazzo Dipartimento di Informatica, Università di
More informationNetwork motifs in the transcriptional regulation network (of Escherichia coli):
Network motifs in the transcriptional regulation network (of Escherichia coli): Janne.Ravantti@Helsinki.Fi (disclaimer: IANASB) Contents: Transcription Networks (aka. The Very Boring Biology Part ) Network
More informationRui Dilão NonLinear Dynamics Group, IST
1st Conference on Computational Interdisciplinary Sciences (CCIS 2010) 23-27 August 2010, INPE, São José dos Campos, Brasil Modeling, Simulating and Calibrating Genetic Regulatory Networks: An Application
More informationComputational Modelling in Systems and Synthetic Biology
Computational Modelling in Systems and Synthetic Biology Fran Romero Dpt Computer Science and Artificial Intelligence University of Seville fran@us.es www.cs.us.es/~fran Models are Formal Statements of
More informationComputing Reaction Rates Using Macro-states
Computing Reaction Rates Using Macro-states Badi Abdul-Wahid 1 Ronan Costaouec 2 Eric Darve 2 Michelle Feng 1 Jesús Izaguirre 1 1 Notre-Dame University 2 Stanford University Tuesday July 3rd 2012 14:30
More informationStochastic differential equations in neuroscience
Stochastic differential equations in neuroscience Nils Berglund MAPMO, Orléans (CNRS, UMR 6628) http://www.univ-orleans.fr/mapmo/membres/berglund/ Barbara Gentz, Universität Bielefeld Damien Landon, MAPMO-Orléans
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
More informationLinearly-Solvable Stochastic Optimal Control Problems
Linearly-Solvable Stochastic Optimal Control Problems Emo Todorov Applied Mathematics and Computer Science & Engineering University of Washington Winter 2014 Emo Todorov (UW) AMATH/CSE 579, Winter 2014
More informationGeneralized Ensembles: Multicanonical Simulations
Generalized Ensembles: Multicanonical Simulations 1. Multicanonical Ensemble 2. How to get the Weights? 3. Example Runs and Re-Weighting to the Canonical Ensemble 4. Energy and Specific Heat Calculation
More informationMACROSCOPIC VARIABLES, THERMAL EQUILIBRIUM. Contents AND BOLTZMANN ENTROPY. 1 Macroscopic Variables 3. 2 Local quantities and Hydrodynamics fields 4
MACROSCOPIC VARIABLES, THERMAL EQUILIBRIUM AND BOLTZMANN ENTROPY Contents 1 Macroscopic Variables 3 2 Local quantities and Hydrodynamics fields 4 3 Coarse-graining 6 4 Thermal equilibrium 9 5 Two systems
More informationAccurate hybrid stochastic simulation of a system of coupled chemical or biochemical reactions
THE JOURNAL OF CHEMICAL PHYSICS 122, 054103 2005 Accurate hybrid schastic simulation of a system of coupled chemical or biochemical reactions Howard Salis and Yiannis Kaznessis a) Department of Chemical
More informationTopics in AI (CPSC 532L): Multimodal Learning with Vision, Language and Sound. Lecture 3: Introduction to Deep Learning (continued)
Topics in AI (CPSC 532L): Multimodal Learning with Vision, Language and Sound Lecture 3: Introduction to Deep Learning (continued) Course Logistics - Update on course registrations - 6 seats left now -
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 6
MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 6. Renewal Mathematically, renewal refers to a continuous time stochastic process with states,, 2,. N t {,, 2, 3, } so that you only have jumps from x to x + and
More informationStochastic Demography, Coalescents, and Effective Population Size
Demography Stochastic Demography, Coalescents, and Effective Population Size Steve Krone University of Idaho Department of Mathematics & IBEST Demographic effects bottlenecks, expansion, fluctuating population
More informationExam in TMA4195 Mathematical Modeling Solutions
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Exam in TMA495 Mathematical Modeling 6..07 Solutions Problem a Here x, y are two populations varying with time
More informationc 2005 Society for Industrial and Applied Mathematics
MULTISCALE MODEL. SIMUL. Vol. 4, No. 3, pp. 867 895 c 2005 Society for Industrial and Applied Mathematics CONSISTENCY AND STABILITY OF TAU-LEAPING SCHEMES FOR CHEMICAL REACTION SYSTEMS MURUHAN RATHINAM,
More informationZacros. Software Package Development: Pushing the Frontiers of Kinetic Monte Carlo Simulation in Catalysis
Zacros Software Package Development: Pushing the Frontiers of Kinetic Monte Carlo Simulation in Catalysis Jens H Nielsen, Mayeul D'Avezac, James Hetherington & Michail Stamatakis Introduction to Zacros
More informationSupporting Information: Thermodynamics of Statistical Inference by Cells
Supporting Information: Thermodynamics of Statistical Inference by Cells Alex H. Lang, 1 Charles K. Fisher, 1 Thierry Mora, and Pankaj Mehta 1 1 Physics Department, Boston University, Boston, Massachusetts
More information