Longtime behavior of stochastically modeled biochemical reaction networks

Size: px
Start display at page:

Download "Longtime behavior of stochastically modeled biochemical reaction networks"

Transcription

1 Longtime behavior of stochastically modeled biochemical reaction networks David F. Anderson Department of Mathematics University of Wisconsin - Madison ASU Math Biology Seminar February 17th, 217

2 Overview Biochemical interaction systems are used to model intracellular processes: 1. Models of gene and protein regulatory systems, 2. neuronal networks, 3. models of virus infection 4. And can be used for population models: SIR. Typically these systems are mathematically modeled in one of two ways: Deterministic models ODEs with deterministic mass-action kinetics. Stochastic models continuous-time Markov chains.

3 Overview Type of mathematical question I am interested in: Can we prove general theorems relating dynamical properties of the mathematical model to the structure of the interaction network. Key point of research: We want theorems that are applicable to whole classes of reaction networks; we are not studying a single model. Outline: After introducing the models, I will focus on two results one is about stationary distributions, one is about possible extinctions/medium time behavior. This work is part of chemical reaction network theory (CRNT).

4 Reaction networks Focus is on reaction networks. A + B 2B B A

5 Reaction networks 1 1 Guy Shinar and Martin Feinberg, Structural Sources of Robustness in Biochemical Reaction Networks, Science, 21

6 Ligand-Receptor model for T-cell - Omer Dushek (Oxford) is L + R kon k off C k off k p C 2 ϕkp C 1. which will be related to the simple models A k 1 B or α A k 2 β

7 Reaction networks Each network is composed of three sets, {S, C, R}: 1. S, species constituent components 2. C, complexes linear combinations of the species 3. R, reactions ordered pairs of complexes. Example: A + B 2B B A S = {A, B}. C = {A + B, 2B, B, A}. R = {A + B 2B, B A}.

8 Reaction networks: {S, C, R} Example: Species: S = {A, B, C, D, E}. Complexes: C = {A, 2B, A + C, D, B + E}. Reactions: R = {A 2B, 2B A, A+C D, D A+C, D B+E, B+E A+C}. ζ 1 = 1 2, ζ 2 = 1 2, ζ 3 = 1 1 1,...

9 Dynamics deterministic with mass-action kinetics Example: A + B κ 1 2B B κ 2 A (R1) (R2) Let x(t) R 2 give concentrations of molecules of A and B: [ 1 ẋ = r 1 (x) 1 ] [ 1 + r 2 (x) 1 ]. Deterministic mass-action kinetics says: so r 1 (x) = κ 1 x A x B, and r 2 (x) = κ 2 x B. ẋ A = κ 1 x A x B + κ 2 x B ẋ B = κ 1 x A x B κ 2 x B. Nonlinear if any reaction requires two or more molecules.

10 Dynamics deterministic Example:

11 Dynamics: discrete stochastic Example: α β A (R1/R2) X(t) = X() + N 1 (t) N 2 (t). where N 1 and N 2 are counting processes satisfying P(N 1 (t + h) N 1 (t) = 1) = αh + o(h) P(N 2 (t + h) N 2 (t) = 1) = βx A (t)h + o(h) P(more than one jump in [t, t + h)) = o(h). So this is a discrete space, continuous time Markov chain. Can show (Tom Kurtz) N 1 (t) = Y 1 (αt) N 2 (t) = Y 2 (β t ) X A (s)ds where Y 1, Y 2 are independent unit-rate Poisson processes. t ) X(t) = X() + Y 1 (αt) Y 2 (β X A (s)ds.

12 Dynamics: discrete stochastic Example: A + B κ 1 2B B κ 2 A (R1) (R2) For Markov models can take [ 1 X(t) = X() + N 1 (t) 1 N 1 (t) = Y 1 ( κ 1 t N 2 (t) = Y 2 ( κ 2 t ] [ 1 + N 2 (t) 1 ) X A (s)x B (s)ds ) X B (s)ds where Y 1, Y 2 are independent unit-rate Poisson processes. ].

13 Model of viral infection: Srivistava, You, Summers, and Yin, J. Theor. Biol., 218 (22) R 1 ) T 1 T + G, R 2 ) G.25 T, R 3 ) T 1 T + S, R 4 ) T.25, R 5 ) S 2, R 6 ) G + S V, X G (t) = X G () + Y 1 ( t t X S (t) = X S () + Y 3 (1 t X T (t) = X T () + Y 2 (.25 ( t X V (t) = X V () + Y ) ( X T (s)ds Y 2.25 ) ( X T (s)ds Y 5 2 t t ) ( X G (s)ds Y 4.25 ) X G (s)x S (s)ds ) t ) X G (s)ds Y 6 ( X G (s)x S (s)ds ) ) t X S (s)ds Y 6 ( X G (s)x S (s)ds t ) X T (s)ds structure Counts virus genome 1 1 template Time (Days)

14 Dynamics: discrete stochastic For general system, we have The rate (or intensity or propensity) of kth reaction is λ k : Z d R. As before: X(t) = X() + k N k (t)ζ k, with X(t) = X() + k Y k ( t Y k are independent, unit-rate Poisson processes. ) λ k (X(s))ds ζ k,

15 Mass-action kinetics The standard intensity function chosen is stochastic mass-action kinetics: λ k (x) = κ k i x i! (x i y ki )!. Example: If S 1 anything, then λ k (x) = κ k x 1. Example: If S 1 + S 2 anything, then λ k (x) = κ k x 1 x 2. Example: If 2S 2 anything, then λ k (x) = κ k x 2 (x 2 1) κ 2 x 2 2 if x 2 1. Note: rates are nonlinear if two more molecules are required.

16 Other ways to understand model Could just say that for x Z d, x + ζ 1, x + ζ 2, x. x + ζ r, with rate λ 1 (x) with rate λ 2 (x) with rate λ r (x) where ζ k Z d. a continuous time Markov chain with infinitesimal generator Af (x) = k λ k (x)(f (x + ζ k ) f (x)). Markov model with forward (chemical master) equation p t (x) = k p t(x ζ k )λ k (x ζ k ) k p t(x)λ k (x) Can simulate with Gillespie s algorithm or the next reaction method.

17 Story #1: stationary distributions Stationary distributions play a central role in understanding (all) stochastic models. They: 1. Characterize the long-time behavior of the model. 2. Are used heavily in stochastic averaging (and, therefore, transient dynamics). They are a fixed point of the chemical master equation: d dt pµ(x, t) = k p µ(x ζ k, t)λ k (x ζ k ) k p µ(x, t)λ k (x), Thus, they solve λ k (x ζ k )π(x ζ k ) = k k λ k (x)π(x). Problems: 1. there is one such equation for each state, x, in the state space. 2. the functions λ k are often nonlinear.

18 Story #1: stationary distributions Wide open question: when does a stationary distribution exist for this class of models? Maybe: if the ode model has a globally stable fixed point, then stochastic model has stationary distribution? False. Ode: ȧ = k 1 k 2 ab k 1 A k 1 B A + B k 2. Stable equilibrium for each initial condition. Stochastic: X a(t) X b (t) is a random walk. ḃ = k 1 k 2 ab

19 Deficiency Zero Theorem - stochastic Theorem (Anderson, Craciun, Kurtz, 21) Let {S, C, R} be a chemical reaction network with rate constants κ k. Suppose the deterministic, mass-action model has complex-balanced equilibrium c. Then, for any irreducible communicating equivalence class, Γ Z d, the stochastic system has a product form stationary distribution π(x) = 1 Z V where Z V is a normalizing constant. d i=1 e c c x i i i, x Γ, (1) x i! Horn, Jackson, Feinberg: ODE has a complex balanced equilibrium if 1. the network is weakly reversible, and 2. has a deficiency of zero. David F. Anderson, Gheorghe Craciun, and Thomas G. Kurtz, Product-form stationary distributions for deficiency zero chemical reaction networks, Bulletin of Mathematical Biology, Vol. 72, No. 8, , 21.

20 Connectivity Definition A chemical reaction network, {S, C, R}, is called weakly reversible if each connected component of the network is strongly connected. A network is called reversible if y k y k R whenever y k y k R. Weakly Reversible C 1 Reversible C 1 C 3 C 2 C 3 C 2

21 Connectivity The following is not weakly reversible: C 2 C 3 C 5 C 6 C 7 C 1 C 4 C 8 Neither is the following: A + B α 2B (Linkage Class 1) B β A (Linkage Class 2)

22 Deficiency. deficiency of {S, C, R} = δ = n l s, where 1. n = # of complexes. 2. l = # of connected components of the network. 3. s = dimension of span of reaction vectors. So it is easy to check. Example A + B 2B B A (R1) (R2) n = 4, l = 2, s = 1 = δ = 1.

23 Deficiency Example n = 5 l = 2 s = 3 = δ = =.

24 Deficiency Of course, you are thinking I have no idea what deficiency is that was pointless. In reality, ẋ = f (x) = YA κψ(x), where 1. Y and A κ are matrices, 2. and deficiency = δ = dim(ker(y ) imagea κ).

25 Deficiency Zero Theorem - stochastic Theorem (Anderson, Craciun, Kurtz, 21) Let {S, C, R} be a chemical reaction network with rate constants κ k. Suppose the deterministic, mass-action model has complex-balanced equilibrium c. Then, for any irreducible communicating equivalence class, Γ Z d, the stochastic system has a product form stationary distribution π(x) = 1 Z V where Z V is a normalizing constant. d i=1 e c c x i i i, x Γ, (2) x i! Horn, Jackson, Feinberg: ODE has a complex balanced equilibrium if 1. the network is weakly reversible, and 2. has a deficiency of zero. Proof: just check. Greatly generalizes linear results. David F. Anderson, Gheorghe Craciun, and Thomas G. Kurtz, Product-form stationary distributions for deficiency zero chemical reaction networks, Bulletin of Mathematical Biology, Vol. 72, No. 8, , 21.

26 Example: Enzyme kinetics Consider the possible model of enzyme kinetics given by E + S ES E + P, E S Easy to see that deficiency is and that Γ = Z 4. Thus, in distributional equilibrium, the species numbers are independent and have Poisson distributions.

27 Enzyme kinetics Consider the slightly different enzyme kinetics given by E + S ES E + P, E We see S + ES + P = N Tot. In distributional equilibrium: E has Poisson distribution, S, ES, P have a multinomial distribution, and E is independent from S, ES, and P.

28 Ligand-Receptor model for T-cell - Omer Dushek (Oxford) is L + R kon k off C k off k p C 2 ϕkp C 1. Also used in spatial models: works by (i) Reed, Popovic and McKinley, and (ii) Per Lötstedt.

29 Story 2: Absolute concentration robustness Guy Shinar and Martin Feinberg, Structural Sources of Robustness in Biochemical Reaction Networks, Science, 21. A + B α 2B B β A (R1) (R2) ẋ A (t) = αx A (t)x B (t) + βx B (t) ẋ B (t) = αx A (t)x B (t) βx B (t) M = def x A () + x B (), Solving for equilibria: x A = β α, x B = M β α, Network has absolute concentration robustness in species A.

30 We also made similar measur osmolarity, in which the culture me Once again we found that ompc om insensitive to the expression level o below WT, and that the ratio decre for EnvZ levels above WT (Fig normalized the fluorescence and E ing low osmolarity WT values. W EnvZ at high osmolarity is larger th by a factor of 2.1, which is similar in ref. 38. Fig. 4b also includes the lo asenseofscaleforthechangei between low and high osmolarity transcription at fixed osmolarity. Absolute concentration robustness OmpC OmpF Transcription Is Insensiti OmpR. To test whether the EnvZ respect to OmpR, we constructed carries a copy of ompr that lacks it and is under control of the lac p Methods). When we transformed 2 with peb15 we were able to vary O orders of magnitude ( 1-fold be 2 Batchelor and Goulian, Fig. 4. (a) Robustness CFP YFP fluorescence and the ratios cycle versus ofenvz phosphorylation levels for culturesand of dephosphorylation levels) by adjusting the in concentra MDG135 penvz at low osmolarity (minimal medium) with varying amounts of medium. The levels of EnvZ did n a two-component regulatory IPTG. Fluorescence system, and EnvZ PNAS, levels22 were normalized by WT values, which were this range except at the very highe

31 Theorems: deterministic and stochastic Theorem (M. Feinberg and G. Shinar, Science, 21 deterministic) Consider a deterministic mass-action system that has a deficiency of one. admits a positive steady state and has two non-terminal complexes that differ only in species S, then the system has absolute concentration robustness in S.

32 Differing in one species Examples: 1. differ in species B. A, A + B 2. differ in species Y p. XT, XT + Y p 3. differ in species G. T, T + G

33 Terminal and non-terminal complexes k 1 XD X XT X p k 2 [ D] k 6 k 3 k4 X p +Y X p Y X+Y p k 7 k 8 k 9 [ T] XD+Y p XDY p XD+Y k 1 k 11 k 5 The orange complexes are called terminal. The blue complexes are called non-terminal.

34 Theorems: deterministic and stochastic Theorem (M. Feinberg and G. Shinar, Science, 21 deterministic) Consider a deterministic mass-action system that has a deficiency of one. admits a positive steady state and has two non-terminal complexes that differ only in species S, then the system has absolute concentration robustness in S. What about stochastically modeled systems? Theorem (A., Enciso, Johnston stochastic) Consider a reaction network satisfying the following: has a deficiency of one, the deterministic model admits a positive steady state, has two non-terminal complexes that differ only in species S, (new) is conservative, then with probability one there is a last time a nonterminal reaction fires. 2 David F. Anderson, Germán Enciso, and Matthew Johnston, Stochastic analysis of biochemical reaction networks with absolute concentration robustness, J. Royal Society Interface, Vol. 11, , February 12, 214.

35 Example Reaction network A + B 2B B A has state space # B Molecules # A Molecuels

36 Example

37 Idea of proof 1. Suppose not true: then there is a positive recurrent state for which a nonterminal complex has positive intensity (rate). 2. This provides a series of stopping times, τ N. 3. Use stochastic equation: = X (τ N ) X () = k = [ ( 1 τn κ k τn κ k k (X (s)) y k ds Y k κ k ( τn ) Y k κ i (X (s)) y k ds ζ k ) (X (s)) y k ds 1 t N ] τn (X (s)) y k ds ζ k 4. In limit N, find something in kernel of YA κ that can not be there.

38 Extinction can be rare event. What s real behavior? A + B α 2B B β A X A () + X B () = M, # B Molecules # A Molecuels MATLAB: β = 1, α = 1, M big Can show that quasi-stationary distribution for A converges to Poisson πm(x) Q e (β/α) (β/α) x, as M. x!

39 Quasi-stationary distribution: EnvZ-OmpR signaling system 3 3 Guy Shinar and Martin Feinberg, Structural Sources of Robustness in Biochemical Reaction Networks, Science, 21

40 Quasi-stationary distribution Quasi stationary probabilities X tot = 1 Y tot = 35 X tot = 1 Y tot = 35 X tot = 1 Y tot = 35 Poisson Molecules of Y p

41 Behavior on compact time intervals Let N be a scaling parameter (total conserved value), and consider N 1. Let q be the value of the ACR equilibrium value and let J Poisson(q). (3) Theorem (Anderson, Cappelletti, Kurtz, ) Suppose t > and that some technical assumptions hold on the reaction network and let J be as in (3). Then, for k, ( ) P XACR,i(t) N N = k P(J i = k) = e q q k i i k!. 4 David F. Anderson, Daniele Cappelletti, and Thomas G. Kurtz, Finite time distributions of stochastically modeled chemical systems with absolute concentration robustness, submitted, 217

42 That is the story. Thanks! Main References: 1. David F. Anderson, Gheorghe Craciun, Thomas G. Kurtz, Product-form stationary distributions for deficiency zero chemical reaction networks, Bulletin of Mathematical Biology, Vol. 72, No. 8, , Guy Shinar and Martin Feinberg, Structural Sources of Robustness in Biochemical Reaction Networks, Science, David F. Anderson, Germán Enciso, and Matthew Johnston, Stochastic analysis of biochemical reaction networks with absolute concentration robustness, J. Royal Society Interface, Vol. 11, , February 12, David F. Anderson, Daniele Cappelletti, and Thomas G. Kurtz, Finite time distributions of stochastically modeled chemical systems with absolute concentration robustness, submitted, David F. Anderson and Thomas G. Kurtz, Stochastic analysis of biochemical systems, Springer, 215.

Stochastic and deterministic models of biochemical reaction networks

Stochastic and deterministic models of biochemical reaction networks Stochastic and deterministic models of biochemical reaction networks David F. Anderson Department of Mathematics University of Wisconsin - Madison Case Western Reserve November 9th, 215 Goals of the talk

More information

Stochastic analysis of biochemical reaction networks with absolute concentration robustness

Stochastic analysis of biochemical reaction networks with absolute concentration robustness Stochastic analysis of biochemical reaction networks with absolute concentration robustness David F. Anderson anderson@math.wisc.edu Department of Mathematics University of Wisconsin - Madison Boston University

More information

Chemical reaction network theory for stochastic and deterministic models of biochemical reaction systems

Chemical reaction network theory for stochastic and deterministic models of biochemical reaction systems Chemical reaction network theory for stochastic and deterministic models of biochemical reaction systems University of Wisconsin at Madison anderson@math.wisc.edu MBI Workshop for Young Researchers in

More information

Persistence and Stationary Distributions of Biochemical Reaction Networks

Persistence and Stationary Distributions of Biochemical Reaction Networks Persistence and Stationary Distributions of Biochemical Reaction Networks David F. Anderson Department of Mathematics University of Wisconsin - Madison Discrete Models in Systems Biology SAMSI December

More information

Correspondence of regular and generalized mass action systems

Correspondence of regular and generalized mass action systems Correspondence of regular and generalized mass action systems Van Vleck Visiting Assistant Professor University of Wisconsin-Madison Joint Mathematics Meetings (San Antonio, TX) Saturday, January 10, 2014

More information

Stochastic analysis of biochemical reaction networks with absolute concentration robustness

Stochastic analysis of biochemical reaction networks with absolute concentration robustness Stochastic analysis of biochemical reaction networks with absolute concentration robustness David F. Anderson, Germán A. Enciso, Matthew D. Johnston October 13, 2013 Abstract It has recently been shown

More information

Stochastic models of biochemical systems

Stochastic 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 information

Computational methods for continuous time Markov chains with applications to biological processes

Computational 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 information

2008 Hotelling Lectures

2008 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 information

Discrepancies between extinction events and boundary equilibria in reaction networks

Discrepancies between extinction events and boundary equilibria in reaction networks Discrepancies between extinction events and boundary equilibria in reaction networks David F. nderson Daniele Cappelletti September 2, 208 bstract Reaction networks are mathematical models of interacting

More information

Simulation methods for stochastic models in chemistry

Simulation 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 information

Network Analysis of Biochemical Reactions in Complex Environments

Network Analysis of Biochemical Reactions in Complex Environments 1 Introduction 1 Network Analysis of Biochemical Reactions in Complex Environments Elias August 1 and Mauricio Barahona, Department of Bioengineering, Imperial College London, South Kensington Campus,

More information

Fast Probability Generating Function Method for Stochastic Chemical Reaction Networks

Fast 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 information

c 2018 Society for Industrial and Applied Mathematics

c 2018 Society for Industrial and Applied Mathematics SIAM J. APPL. MATH. Vol. 78, No. 5, pp. 2692 2713 c 2018 Society for Industrial and Applied Mathematics SOME NETWORK CONDITIONS FOR POSITIVE RECURRENCE OF STOCHASTICALLY MODELED REACTION NETWORKS DAVID

More information

Stochastic models for chemical reactions

Stochastic models for chemical reactions First Prev Next Go To Go Back Full Screen Close Quit 1 Stochastic models for chemical reactions Formulating Markov models Two stochastic equations Simulation schemes Reaction Networks Scaling limit Central

More information

Efficient Leaping Methods for Stochastic Chemical Systems

Efficient 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 information

A Deficiency-Based Approach to Parametrizing Positive Equilibria of Biochemical Reaction Systems

A Deficiency-Based Approach to Parametrizing Positive Equilibria of Biochemical Reaction Systems Bulletin of Mathematical Biology https://doi.org/10.1007/s11538-018-00562-0 A Deficiency-Based Approach to Parametrizing Positive Equilibria of Biochemical Reaction Systems Matthew D. Johnston 1 Stefan

More information

2. Mathematical descriptions. (i) the master equation (ii) Langevin theory. 3. Single cell measurements

2. Mathematical descriptions. (i) the master equation (ii) Langevin theory. 3. Single cell measurements 1. Why stochastic?. Mathematical descriptions (i) the master equation (ii) Langevin theory 3. Single cell measurements 4. Consequences Any chemical reaction is stochastic. k P d φ dp dt = k d P deterministic

More information

Extending the Tools of Chemical Reaction Engineering to the Molecular Scale

Extending 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 information

Stochastic Chemical Reaction Networks for Robustly Approximating Arbitrary Probability Distributions

Stochastic Chemical Reaction Networks for Robustly Approximating Arbitrary Probability Distributions Stochastic Chemical Reaction Networks for Robustly Approximating Arbitrary Probability Distributions Daniele Cappelletti Andrés Ortiz-Muñoz David F. Anderson Erik Winfree October 5, 08 Abstract We show

More information

Gillespie 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 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 information

Lyapunov functions, stationary distributions, and non-equilibrium potential for chemical reaction networks

Lyapunov functions, stationary distributions, and non-equilibrium potential for chemical reaction networks Lyapunov functions, stationary distributions, and non-equilibrium potential for chemical reaction networks David F. Anderson, Gheorghe Craciun, Manoj Gopalkrishnan, Carsten Wiuf October 7, 04 Abstract

More information

FUNDAMENTALS of SYSTEMS BIOLOGY From Synthetic Circuits to Whole-cell Models

FUNDAMENTALS of SYSTEMS BIOLOGY From Synthetic Circuits to Whole-cell Models FUNDAMENTALS of SYSTEMS BIOLOGY From Synthetic Circuits to Whole-cell Models Markus W. Covert Stanford University 0 CRC Press Taylor & Francis Group Boca Raton London New York Contents /... Preface, xi

More information

Matthew Douglas Johnston December 15, 2014 Van Vleck Visiting Assistant Professor

Matthew Douglas Johnston December 15, 2014 Van Vleck Visiting Assistant Professor Matthew Douglas Johnston December 15, 2014 Van Vleck Visiting Assistant Professor mjohnston3@wisc.edu Department of Mathematics www.math.wisc.edu/ mjohnston3 Phone: (608) 263-2727 480 Lincoln Dr., Madison,

More information

Modelling in Systems Biology

Modelling 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 information

arxiv: v2 [math.ds] 12 Jul 2011

arxiv: v2 [math.ds] 12 Jul 2011 1 CHEMICAL REACTION SYSTEMS WITH TORIC STEADY STATES MERCEDES PÉREZ MILLÁN, ALICIA DICKENSTEIN, ANNE SHIU, AND CARSTEN CONRADI arxiv:11021590v2 [mathds] 12 Jul 2011 Abstract Mass-action chemical reaction

More information

Mathematical and computational methods for understanding the dynamics of biochemical networks

Mathematical and computational methods for understanding the dynamics of biochemical networks Mathematical and computational methods for understanding the dynamics of biochemical networks Gheorghe Craciun Department of Mathematics and Department of Biomolecular Chemistry University of Wisconsin

More information

From 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 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 information

8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains

8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains 8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains 8.1 Review 8.2 Statistical Equilibrium 8.3 Two-State Markov Chain 8.4 Existence of P ( ) 8.5 Classification of States

More information

Network Theory II: Stochastic Petri Nets, Chemical Reaction Networks and Feynman Diagrams. John Baez, Jacob Biamonte, Brendan Fong

Network Theory II: Stochastic Petri Nets, Chemical Reaction Networks and Feynman Diagrams. John Baez, Jacob Biamonte, Brendan Fong Network Theory II: Stochastic Petri Nets, Chemical Reaction Networks and Feynman Diagrams John Baez, Jacob Biamonte, Brendan Fong A Petri net is a way of drawing a finite set S of species, a finite set

More information

BE 150 Problem Set #2 Issued: 16 Jan 2013 Due: 23 Jan 2013

BE 150 Problem Set #2 Issued: 16 Jan 2013 Due: 23 Jan 2013 M. Elowitz and R. M. Murray Winter 2013 CALIFORNIA INSTITUTE OF TECHNOLOGY Biology and Biological Engineering (BBE) BE 150 Problem Set #2 Issued: 16 Jan 2013 Due: 23 Jan 2013 1. (Shaping pulses; based

More information

Networks in systems biology

Networks in systems biology Networks in systems biology Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4500, Spring 2017 M. Macauley (Clemson) Networks in systems

More information

Noise-induced Mixing and Multimodality in Reaction Networks

Noise-induced Mixing and Multimodality in Reaction Networks Accepted for publication in European Journal of Applied Mathematics (EJAM). 1 Noise-induced Mixing and Multimodality in Reaction Networks TOMISLAV PLESA 1, RADEK ERBAN 1 and HANS G. OTHMER 2 1 Mathematical

More information

Chapter 22 Examples of Computation of Exact Moment Dynamics for Chemical Reaction Networks

Chapter 22 Examples of Computation of Exact Moment Dynamics for Chemical Reaction Networks Chapter 22 Examples of Computation of Exact Moment Dynamics for Chemical Reaction Networks Eduardo D. Sontag Abstract The study of stochastic biomolecular networks is a key part of systems biology, as

More information

Fock Space Techniques for Stochastic Physics. John Baez, Jacob Biamonte, Brendan Fong

Fock Space Techniques for Stochastic Physics. John Baez, Jacob Biamonte, Brendan Fong Fock Space Techniques for Stochastic Physics John Baez, Jacob Biamonte, Brendan Fong A Petri net is a way of drawing a finite set S of species, a finite set T of transitions, and maps s, t : T N S saying

More information

Introduction to asymptotic techniques for stochastic systems with multiple time-scales

Introduction 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 information

Problem Set 5. 1 Waiting times for chemical reactions (8 points)

Problem 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 information

Stochastic Simulation.

Stochastic 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 information

European Conference on Mathematical and Theoretical Biology Gothenburg

European Conference on Mathematical and Theoretical Biology Gothenburg European Conference on Mathematical and Theoretical Biology 2014 - Gothenburg Minisymposium: Numerical methods for high-dimensional problems in biology Date: Monday, 16 th of June Time: 16:00-19:00 Organizers:

More information

Stochastic Processes

Stochastic Processes Stochastic Processes 8.445 MIT, fall 20 Mid Term Exam Solutions October 27, 20 Your Name: Alberto De Sole Exercise Max Grade Grade 5 5 2 5 5 3 5 5 4 5 5 5 5 5 6 5 5 Total 30 30 Problem :. True / False

More information

Equilibrium Time, Permutation, Multiscale and Modified Multiscale Entropies for Low-High Infection Level Intracellular Viral Reaction Kinetics

Equilibrium Time, Permutation, Multiscale and Modified Multiscale Entropies for Low-High Infection Level Intracellular Viral Reaction Kinetics Equilibrium Time, Permutation, Multiscale and Modified Multiscale Entropies for Low-High Infection Level Intracellular Viral Reaction Kinetics Fariborz Taherkhani 1, Farid Taherkhani 2* 1 Department of

More information

Computer Simulation and Data Analysis in Molecular Biology and Biophysics

Computer Simulation and Data Analysis in Molecular Biology and Biophysics Victor Bloomfield Computer Simulation and Data Analysis in Molecular Biology and Biophysics An Introduction Using R Springer Contents Part I The Basics of R 1 Calculating with R 3 1.1 Installing R 3 1.1.1

More information

CDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes

CDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic process X = {X(t), t2 T} is a collection of random variables (rvs); one rv

More information

Basic modeling approaches for biological systems. Mahesh Bule

Basic modeling approaches for biological systems. Mahesh Bule Basic modeling approaches for biological systems Mahesh Bule The hierarchy of life from atoms to living organisms Modeling biological processes often requires accounting for action and feedback involving

More information

Algebraic methods for the study of biochemical reaction networks

Algebraic methods for the study of biochemical reaction networks Algebraic methods for the study of biochemical reaction networks Alicia Dickenstein Departamento de Matemática, FCEN, Universidad de Buenos Aires, and Instituto de Matemática Luis A. Santaló, UBA CONICET

More information

Lecture 7: Simple genetic circuits I

Lecture 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 information

Invariant Manifold Reductions for Markovian Ion Channel Dynamics

Invariant Manifold Reductions for Markovian Ion Channel Dynamics Invariant Manifold Reductions for Markovian Ion Channel Dynamics James P. Keener Department of Mathematics, University of Utah, Salt Lake City, UT 84112 June 4, 2008 Abstract We show that many Markov models

More information

CDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical

CDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical CDA5530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic ti process X = {X(t), t T} is a collection of random variables (rvs); one

More information

A Moment Closure Method for Stochastic Chemical Reaction Networks with General Kinetics

A Moment Closure Method for Stochastic Chemical Reaction Networks with General Kinetics MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 2013 785-800 ISSN 0340-6253 A Moment Closure Method for Stochastic Chemical Reaction Networks with General

More information

MS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10. x n+1 = f(x n ),

MS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10. x n+1 = f(x n ), MS&E 321 Spring 12-13 Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10 Section 4: Steady-State Theory Contents 4.1 The Concept of Stochastic Equilibrium.......................... 1 4.2

More information

Gene Expression as a Stochastic Process: From Gene Number Distributions to Protein Statistics and Back

Gene Expression as a Stochastic Process: From Gene Number Distributions to Protein Statistics and Back Gene Expression as a Stochastic Process: From Gene Number Distributions to Protein Statistics and Back June 19, 2007 Motivation & Basics A Stochastic Approach to Gene Expression Application to Experimental

More information

MARKOV PROCESSES. Valerio Di Valerio

MARKOV PROCESSES. Valerio Di Valerio MARKOV PROCESSES Valerio Di Valerio Stochastic Process Definition: a stochastic process is a collection of random variables {X(t)} indexed by time t T Each X(t) X is a random variable that satisfy some

More information

Chapter 7. Markov chain background. 7.1 Finite state space

Chapter 7. Markov chain background. 7.1 Finite state space Chapter 7 Markov chain background A stochastic process is a family of random variables {X t } indexed by a varaible t which we will think of as time. Time can be discrete or continuous. We will only consider

More information

A review of Continuous Time MC STA 624, Spring 2015

A review of Continuous Time MC STA 624, Spring 2015 A review of Continuous Time MC STA 624, Spring 2015 Ruriko Yoshida Dept. of Statistics University of Kentucky polytopes.net STA 624 1 Continuous Time Markov chains Definition A continuous time stochastic

More information

Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals

Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Noèlia Viles Cuadros BCAM- Basque Center of Applied Mathematics with Prof. Enrico

More information

dynamic processes in cells (a systems approach to biology)

dynamic processes in cells (a systems approach to biology) dynamic processes in cells (a systems approach to biology) jeremy gunawardena department of systems biology harvard medical school lecture 6 18 september 2014 weak linkage facilitates variation and evolution

More information

Dynamical Systems in Biology

Dynamical Systems in Biology Dynamical Systems in Biology Hal Smith A R I Z O N A S T A T E U N I V E R S I T Y H.L. Smith (ASU) Dynamical Systems in Biology ASU, July 5, 2012 1 / 31 Outline 1 What s special about dynamical systems

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on

More information

3A Discrete Markov processes and stochastic hybrid systems.

3A Discrete Markov processes and stochastic hybrid systems. 3A Discrete Markov processes and stochastic hybrid systems. So far we have encountered two examples of discrete Markov process: the random walk (Sect. 2.1) and the birth-death process for an ensemble of

More information

Lecture 4 The stochastic ingredient

Lecture 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 information

Stochastic modelling of epidemic spread

Stochastic modelling of epidemic spread Stochastic modelling of epidemic spread Julien Arino Centre for Research on Inner City Health St Michael s Hospital Toronto On leave from Department of Mathematics University of Manitoba Julien Arino@umanitoba.ca

More information

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is MARKOV CHAINS What I will talk about in class is pretty close to Durrett Chapter 5 sections 1-5. We stick to the countable state case, except where otherwise mentioned. Lecture 7. We can regard (p(i, j))

More information

arxiv: v2 [math.na] 21 Jul 2014

arxiv: v2 [math.na] 21 Jul 2014 A Computational Approach to Steady State Correspondence of Regular and Generalized Mass Action Systems Matthew D. Johnston arxiv:1407.4796v2 [math.na] 21 Jul 2014 Contents Department of Mathematics University

More information

Stochastic Modelling Unit 1: Markov chain models

Stochastic Modelling Unit 1: Markov chain models Stochastic Modelling Unit 1: Markov chain models Russell Gerrard and Douglas Wright Cass Business School, City University, London June 2004 Contents of Unit 1 1 Stochastic Processes 2 Markov Chains 3 Poisson

More information

Stochastic Modeling of Chemical Reactions

Stochastic 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 information

arxiv: v2 [q-bio.mn] 31 Aug 2007

arxiv: v2 [q-bio.mn] 31 Aug 2007 A modified Next Reaction Method for simulating chemical systems with time dependent propensities and delays David F. Anderson Department of Mathematics, University of Wisconsin-Madison, Madison, Wi 53706

More information

Introduction to Stochastic Processes with Applications in the Biosciences

Introduction to Stochastic Processes with Applications in the Biosciences Introduction to Stochastic Processes with Applications in the Biosciences David F. Anderson University of Wisconsin at Madison Copyright c 213 by David F. Anderson. Contents 1 Introduction 4 1.1 Why study

More information

When do diffusion-limited trajectories become memoryless?

When 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 information

Markov chains and the number of occurrences of a word in a sequence ( , 11.1,2,4,6)

Markov chains and the number of occurrences of a word in a sequence ( , 11.1,2,4,6) Markov chains and the number of occurrences of a word in a sequence (4.5 4.9,.,2,4,6) Prof. Tesler Math 283 Fall 208 Prof. Tesler Markov Chains Math 283 / Fall 208 / 44 Locating overlapping occurrences

More information

Cybergenetics: Control theory for living cells

Cybergenetics: Control theory for living cells Department of Biosystems Science and Engineering, ETH-Zürich Cybergenetics: Control theory for living cells Corentin Briat Joint work with Ankit Gupta and Mustafa Khammash Introduction Overview Cybergenetics:

More information

Markov Chain BSDEs and risk averse networks

Markov Chain BSDEs and risk averse networks Markov Chain BSDEs and risk averse networks Samuel N. Cohen Mathematical Institute, University of Oxford (Based on joint work with Ying Hu, Robert Elliott, Lukas Szpruch) 2nd Young Researchers in BSDEs

More information

AARMS Homework Exercises

AARMS Homework Exercises 1 For the gamma distribution, AARMS Homework Exercises (a) Show that the mgf is M(t) = (1 βt) α for t < 1/β (b) Use the mgf to find the mean and variance of the gamma distribution 2 A well-known inequality

More information

Stochastic modelling of epidemic spread

Stochastic modelling of epidemic spread Stochastic modelling of epidemic spread Julien Arino Department of Mathematics University of Manitoba Winnipeg Julien Arino@umanitoba.ca 19 May 2012 1 Introduction 2 Stochastic processes 3 The SIS model

More information

Markov processes and queueing networks

Markov 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 information

Winter 2019 Math 106 Topics in Applied Mathematics. Lecture 9: Markov Chain Monte Carlo

Winter 2019 Math 106 Topics in Applied Mathematics. Lecture 9: Markov Chain Monte Carlo Winter 2019 Math 106 Topics in Applied Mathematics Data-driven Uncertainty Quantification Yoonsang Lee (yoonsang.lee@dartmouth.edu) Lecture 9: Markov Chain Monte Carlo 9.1 Markov Chain A Markov Chain Monte

More information

Lecture 1 Modeling in Biology: an introduction

Lecture 1 Modeling in Biology: an introduction Lecture 1 in Biology: an introduction 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 information

Stochastic Simulation Methods for Solving Systems with Multi-State Species

Stochastic 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 information

Stochastic Simulation of Biochemical Reactions

Stochastic 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 information

arxiv: v2 [q-bio.qm] 12 Jan 2017

arxiv: v2 [q-bio.qm] 12 Jan 2017 Approximation and inference methods for stochastic biochemical kinetics - a tutorial review arxiv:1608.06582v2 [q-bio.qm] 12 Jan 2017 David Schnoerr 1,2,3, Guido Sanguinetti 2,3, and Ramon Grima 1,3,*

More information

CHEMICAL REACTION NETWORK THEORY

CHEMICAL REACTION NETWORK THEORY CHEMICAL REACTION NETWORK THEORY Contents 1. Notations 2 2. Network definition 2 3. Deterministic mass-action CRN 2 4. Stochastic mass-action CRN 2 5. Mapping 3 6. Network structure 4 6.1. Linkage classes

More information

Convergence of Feller Processes

Convergence of Feller Processes Chapter 15 Convergence of Feller Processes This chapter looks at the convergence of sequences of Feller processes to a iting process. Section 15.1 lays some ground work concerning weak convergence of processes

More information

Matthew Douglas Johnston June 12, 2016 Assistant Professor

Matthew Douglas Johnston June 12, 2016 Assistant Professor Matthew Douglas Johnston June 12, 2016 Assistant Professor matthew.johnston@sjsu.edu Department of Mathematics johnstonmd.wordpress.com San José State University Office: DH 215 One Washington Square Phone:

More information

Exact Simulation of the Stationary Distribution of M/G/c Queues

Exact Simulation of the Stationary Distribution of M/G/c Queues 1/36 Exact Simulation of the Stationary Distribution of M/G/c Queues Professor Karl Sigman Columbia University New York City USA Conference in Honor of Søren Asmussen Monday, August 1, 2011 Sandbjerg Estate

More information

Lognormal Moment Closures for Biochemical Reactions

Lognormal Moment Closures for Biochemical Reactions Lognormal Moment Closures for Biochemical Reactions Abhyudai Singh and João Pedro Hespanha Abstract In the stochastic formulation of chemical reactions, the dynamics of the the first M -order moments of

More information

Biological Pathways Representation by Petri Nets and extension

Biological Pathways Representation by Petri Nets and extension Biological Pathways Representation by and extensions December 6, 2006 Biological Pathways Representation by and extension 1 The cell Pathways 2 Definitions 3 4 Biological Pathways Representation by and

More information

Stochastic Gene Expression: Modeling, Analysis, and Identification

Stochastic Gene Expression: Modeling, Analysis, and Identification Munsky; q-bio Stochastic Gene Expression: Modeling, Analysis, and Identification Mustafa Khammash University of California, Santa Barbara Center for Control, Dynamical Systems and Computation CC DC Outline

More information

Theoretical Tutorial Session 2

Theoretical Tutorial Session 2 1 / 36 Theoretical Tutorial Session 2 Xiaoming Song Department of Mathematics Drexel University July 27, 216 Outline 2 / 36 Itô s formula Martingale representation theorem Stochastic differential equations

More information

Computational Methods in Systems and Synthetic Biology

Computational Methods in Systems and Synthetic Biology Computational Methods in Systems and Synthetic Biology François Fages EPI Contraintes, Inria Paris-Rocquencourt, France 1 / 62 Need for Abstractions in Systems Biology Models are built in Systems Biology

More information

Modelling chemical kinetics

Modelling chemical kinetics Modelling chemical kinetics Nicolas Le Novère, Institute, EMBL-EBI n.lenovere@gmail.com Systems Biology models ODE models Reconstruction of state variable evolution from process descriptions: Processes

More information

Dynamic System Properties of Biochemical Reaction Systems

Dynamic System Properties of Biochemical Reaction Systems Dynamic System Properties of Biochemical Reaction Systems Balázs Boros Thesis for the Master of Science degree in Applied Mathematics at Institute of Mathematics, Faculty of Science, Eötvös Loránd University,

More information

Brief contents. Chapter 1 Virus Dynamics 33. Chapter 2 Physics and Biology 52. Randomness in Biology. Chapter 3 Discrete Randomness 59

Brief contents. Chapter 1 Virus Dynamics 33. Chapter 2 Physics and Biology 52. Randomness in Biology. Chapter 3 Discrete Randomness 59 Brief contents I First Steps Chapter 1 Virus Dynamics 33 Chapter 2 Physics and Biology 52 II Randomness in Biology Chapter 3 Discrete Randomness 59 Chapter 4 Some Useful Discrete Distributions 96 Chapter

More information

Boolean models of gene regulatory networks. Matthew Macauley Math 4500: Mathematical Modeling Clemson University Spring 2016

Boolean models of gene regulatory networks. Matthew Macauley Math 4500: Mathematical Modeling Clemson University Spring 2016 Boolean models of gene regulatory networks Matthew Macauley Math 4500: Mathematical Modeling Clemson University Spring 2016 Gene expression Gene expression is a process that takes gene info and creates

More information

Advanced Higher Biology. Unit 1- Cells and Proteins 2c) Membrane Proteins

Advanced Higher Biology. Unit 1- Cells and Proteins 2c) Membrane Proteins Advanced Higher Biology Unit 1- Cells and Proteins 2c) Membrane Proteins Membrane Structure Phospholipid bilayer Transmembrane protein Integral protein Movement of Molecules Across Membranes Phospholipid

More information

LAW OF LARGE NUMBERS FOR THE SIRS EPIDEMIC

LAW OF LARGE NUMBERS FOR THE SIRS EPIDEMIC LAW OF LARGE NUMBERS FOR THE SIRS EPIDEMIC R. G. DOLGOARSHINNYKH Abstract. We establish law of large numbers for SIRS stochastic epidemic processes: as the population size increases the paths of SIRS epidemic

More information

ON THE PARAMETRIC UNCERTAINTY OF WEAKLY REVERSIBLE REALIZATIONS OF KINETIC SYSTEMS

ON THE PARAMETRIC UNCERTAINTY OF WEAKLY REVERSIBLE REALIZATIONS OF KINETIC SYSTEMS HUNGARIAN JOURNAL OF INDUSTRY AND CHEMISTRY VESZPRÉM Vol. 42(2) pp. 3 7 (24) ON THE PARAMETRIC UNCERTAINTY OF WEAKLY REVERSIBLE REALIZATIONS OF KINETIC SYSTEMS GYÖRGY LIPTÁK, GÁBOR SZEDERKÉNYI,2 AND KATALIN

More information

Stochastic Processes

Stochastic Processes MTHE/STAT455, STAT855 Fall 202 Stochastic Processes Final Exam, Solutions (5 marks) (a) (0 marks) Condition on the first pair to bond; each of the n adjacent pairs is equally likely to bond Given that

More information

Notes on Chemical Reaction Networks

Notes on Chemical Reaction Networks Notes on Chemical Reaction Networks JWR May 19, 2009, last update: Nov 27, 2009 These notes are shamelessly cribbed from the extremely helpful online notes [2]. Even most of the notation is the same. I

More information

Stochastic modelling in Mathematical Biology

Stochastic modelling in Mathematical Biology Stochastic modelling in Mathematical Biology Daniel Sánchez-Taltavull Centre de Recerca Matemàtica March 4th 2013 D. Sánchez-Taltavull (CRM) Stochastic modelling in Mathematical Biology March 4th 2013

More information

On the numerical solution of the chemical master equation with sums of rank one tensors

On the numerical solution of the chemical master equation with sums of rank one tensors ANZIAM J. 52 (CTAC21) pp.c628 C643, 211 C628 On the numerical solution of the chemical master equation with sums of rank one tensors Markus Hegland 1 Jochen Garcke 2 (Received 2 January 211; revised 4

More information