Product form stationary distributions of stochastic reaction - - PowerPoint PPT Presentation

product form stationary distributions of stochastic
SMART_READER_LITE
LIVE PREVIEW

Product form stationary distributions of stochastic reaction - - PowerPoint PPT Presentation

Product form stationary distributions of stochastic reaction networks, and application to constrained averaging of multiscale systems Simon Cotter University of Manchester 19th July 2016 Simon Cotter Product form stationary dist. 0 / 35


slide-1
SLIDE 1

Product form stationary distributions of stochastic reaction networks, and application to constrained averaging of multiscale systems

Simon Cotter

University of Manchester

19th July 2016

Simon Cotter Product form stationary dist. 0 / 35

slide-2
SLIDE 2

Collaborators

Left: David Anderson (Wisconsin, US), Right: Newton Institute, University of Cambridge, UK Earlier work: Radek Erban (Oxford, UK), Kostas Zygalakis (Edinburgh, UK), Yannis Kevrekidis (Princeton, US) SLC is grateful to EPSRC for First Grant award EP/L023393/1

Simon Cotter Product form stationary dist. 1 / 35

slide-3
SLIDE 3

Outline

1

Introduction

2

The Quasi Steady-State Assumption

3

The Constrained Approach

4

Product Form Stationary Distributions for Non-Mass Action Kinetics

5

Numerical Example

6

Conclusions

Simon Cotter Product form stationary dist. 1 / 35

slide-4
SLIDE 4

Motivation

Simon Cotter Product form stationary dist. 2 / 35

slide-5
SLIDE 5

The Random Time Change Representation

X = [X1, X2, . . . , XN] ∈ NN

0 number of each species in reactor

X(t) = X0 +

M

  • m=1

Ym t αm(X(s))ds

  • νm

Ym independant unit-rate Poisson processes αm(·) ≥ 0 intensities/hazard functions νm ∈ NN

0 stoichiometric vectors

Simon Cotter Product form stationary dist. 3 / 35

slide-6
SLIDE 6

The Random Time Change Representation

X = [X1, X2, . . . , XN] ∈ NN

0 number of each species in reactor

X(t) = X0 +

M

  • m=1

Ym t αm(X(s))ds

  • νm

Ym independant unit-rate Poisson processes αm(·) ≥ 0 intensities/hazard functions νm ∈ NN

0 stoichiometric vectors

Simon Cotter Product form stationary dist. 3 / 35

slide-7
SLIDE 7

The Random Time Change Representation

X = [X1, X2, . . . , XN] ∈ NN

0 number of each species in reactor

X(t) = X0 +

M

  • m=1

Ym t αm(X(s))ds

  • νm

Ym independant unit-rate Poisson processes αm(·) ≥ 0 intensities/hazard functions νm ∈ NN

0 stoichiometric vectors

Simon Cotter Product form stationary dist. 3 / 35

slide-8
SLIDE 8

The Random Time Change Representation

X = [X1, X2, . . . , XN] ∈ NN

0 number of each species in reactor

X(t) = X0 +

M

  • m=1

Ym t αm(X(s))ds

  • νm

Ym independant unit-rate Poisson processes αm(·) ≥ 0 intensities/hazard functions νm ∈ NN

0 stoichiometric vectors

Simon Cotter Product form stationary dist. 3 / 35

slide-9
SLIDE 9

The Random Time Change Representation

X = [X1, X2, . . . , XN] ∈ NN

0 number of each species in reactor

X(t) = X0 +

M

  • m=1

Ym t αm(X(s))ds

  • νm

Ym independant unit-rate Poisson processes αm(·) ≥ 0 intensities/hazard functions νm ∈ NN

0 stoichiometric vectors

Simon Cotter Product form stationary dist. 3 / 35

slide-10
SLIDE 10

Gillespie SSA

[1] Calculate propensity functions αm(t), m = 1, 2, . . . , M. [2] Next reaction time is given by τ = − log (u) α0(X(t)), where α0(X(t)) =

M

  • m=1

αm(X(t)). [3] Choose one j ∈ {1, . . . , M}, with probability αj/α0, and perform reaction Rj. [4] State vector X(t + τ) = X(t) + νj [5] Continue with step [1] with time t = t + τ.

Table: The Stochastic Simulation Algorithm (SSA) by Gillespie.

Simon Cotter Product form stationary dist. 4 / 35

slide-11
SLIDE 11

Multiscale Systems

0.05 0.1 0.15 0.2 70 80 90 100 110 120 130 Time t Number of molecules X1 X2 X3 (X1+X2)/2

k1

− − − − → X1

k2x1

− − − − → ← − − − −

k3x2

X2

k4x2

− − − − → X3

k5x3

− − − − → ∅ Wish to approximate by ∅

k1

− − − − → S

ˆ k4s

− − − − → X3

k5x3

− − − − → ∅

Simon Cotter Product form stationary dist. 5 / 35

slide-12
SLIDE 12

Outline

1

Introduction

2

The Quasi Steady-State Assumption

3

The Constrained Approach

4

Product Form Stationary Distributions for Non-Mass Action Kinetics

5

Numerical Example

6

Conclusions

Simon Cotter Product form stationary dist. 5 / 35

slide-13
SLIDE 13

The Quasi Steady-State Assumption (QSSA)

The QSSA philosophy The assumption is that the fast variables equilibrate on a timescale which is negligible with respect to the rate of change of slow species, i.e. the rates of the slow reactions can be assumed to be zero on the timescale of the fast reactions. In practice In order to approximate the effective rates of slow reactions, which are dependant on the fast variables, we only need to consider the invariant distribution of the fast reactions.

Simon Cotter Product form stationary dist. 6 / 35

slide-14
SLIDE 14

The Quasi Steady-State Assumption (QSSA)

The QSSA philosophy The assumption is that the fast variables equilibrate on a timescale which is negligible with respect to the rate of change of slow species, i.e. the rates of the slow reactions can be assumed to be zero on the timescale of the fast reactions. In practice In order to approximate the effective rates of slow reactions, which are dependant on the fast variables, we only need to consider the invariant distribution of the fast reactions.

Simon Cotter Product form stationary dist. 6 / 35

slide-15
SLIDE 15

QSSA: Simple Example

Consider the system: ∅

k1

− − − − → X1

k2x1

− − − − − − − → ← − − − − − − −

k3x2

X2

k4x2

− − − − → ∅ Effective system: ∅

k1

− − − − → S

ˆ k4s

− − − − → ∅ Fast subsystem: X1

k2x1

− − − − → ← − − − −

k3x2

X2, S = X1 + X2

Simon Cotter Product form stationary dist. 7 / 35

slide-16
SLIDE 16

QSSA: Simple Example

Consider the system: ∅

k1

− − − − → X1

k2x1

− − − − − − − → ← − − − − − − −

k3x2

X2

k4x2

− − − − → ∅ Effective system: ∅

k1

− − − − → S

ˆ k4s

− − − − → ∅ Fast subsystem: X1

k2x1

− − − − → ← − − − −

k3x2

X2, S = X1 + X2

Simon Cotter Product form stationary dist. 7 / 35

slide-17
SLIDE 17

QSSA: Simple Example

Consider the system: ∅

k1

− − − − → X1

k2x1

− − − − − − − → ← − − − − − − −

k3x2

X2

k4x2

− − − − → ∅ Effective system: ∅

k1

− − − − → S

ˆ k4s

− − − − → ∅ Fast subsystem: X1

k2x1

− − − − → ← − − − −

k3x2

X2, S = X1 + X2

Simon Cotter Product form stationary dist. 7 / 35

slide-18
SLIDE 18

QSSA: Simple Example

X1

k2x1

− − − − → ← − − − −

k3x2

X2, S = X1 + X2 Invariant distribution X2 ∼ B(S, λ2) = π(X2) [λ1, λ2] =

  • k3

k2+k3 , k2 k2+k3

  • steady state solution of mean field

ODE: k2λ1 = k3λ2, λ1 + λ2 = 1 Compute expectation of the rate of reaction R4 ˆ α4 = E(α4|S) = k4E(X2|S) = k2k4S k2 + k3

Simon Cotter Product form stationary dist. 8 / 35

slide-19
SLIDE 19

QSSA: Simple Example

X1

k2x1

− − − − → ← − − − −

k3x2

X2, S = X1 + X2 Invariant distribution X2 ∼ B(S, λ2) = π(X2) [λ1, λ2] =

  • k3

k2+k3 , k2 k2+k3

  • steady state solution of mean field

ODE: k2λ1 = k3λ2, λ1 + λ2 = 1 Compute expectation of the rate of reaction R4 ˆ α4 = E(α4|S) = k4E(X2|S) = k2k4S k2 + k3

Simon Cotter Product form stationary dist. 8 / 35

slide-20
SLIDE 20

QSSA: Simple Example

X1

k2x1

− − − − → ← − − − −

k3x2

X2, S = X1 + X2 Invariant distribution X2 ∼ B(S, λ2) = π(X2) [λ1, λ2] =

  • k3

k2+k3 , k2 k2+k3

  • steady state solution of mean field

ODE: k2λ1 = k3λ2, λ1 + λ2 = 1 Compute expectation of the rate of reaction R4 ˆ α4 = E(α4|S) = k4E(X2|S) = k2k4S k2 + k3

Simon Cotter Product form stationary dist. 8 / 35

slide-21
SLIDE 21

QSSA: Simple Example

k1

− − − − → S

k2k4/(k2+k3)s

− − − − − − − − − → ∅ Quantify error by computing error in invariant distribution of S = X1 + X2 S(∞) ∼ P k1(k2 + k3) k2k4

  • (QSSA approximation)

Invariant distribution of full system given by P

  • λ1 = k1

k4 , λ2 = k1(k3+k4) k2k4

  • S(∞) ∼ P
  • k1(k2+k3+k4)

k2k4

  • (True invariant distribution)

QSSA error in Poisson intensity k1

k2

Simon Cotter Product form stationary dist. 9 / 35

slide-22
SLIDE 22

QSSA: Simple Example

k1

− − − − → S

k2k4/(k2+k3)s

− − − − − − − − − → ∅ Quantify error by computing error in invariant distribution of S = X1 + X2 S(∞) ∼ P k1(k2 + k3) k2k4

  • (QSSA approximation)

Invariant distribution of full system given by P

  • λ1 = k1

k4 , λ2 = k1(k3+k4) k2k4

  • S(∞) ∼ P
  • k1(k2+k3+k4)

k2k4

  • (True invariant distribution)

QSSA error in Poisson intensity k1

k2

Simon Cotter Product form stationary dist. 9 / 35

slide-23
SLIDE 23

QSSA: Simple Example

k1

− − − − → S

k2k4/(k2+k3)s

− − − − − − − − − → ∅ Quantify error by computing error in invariant distribution of S = X1 + X2 S(∞) ∼ P k1(k2 + k3) k2k4

  • (QSSA approximation)

Invariant distribution of full system given by P

  • λ1 = k1

k4 , λ2 = k1(k3+k4) k2k4

  • S(∞) ∼ P
  • k1(k2+k3+k4)

k2k4

  • (True invariant distribution)

QSSA error in Poisson intensity k1

k2

Simon Cotter Product form stationary dist. 9 / 35

slide-24
SLIDE 24

QSSA: Simple Example

k1

− − − − → S

k2k4/(k2+k3)s

− − − − − − − − − → ∅ Quantify error by computing error in invariant distribution of S = X1 + X2 S(∞) ∼ P k1(k2 + k3) k2k4

  • (QSSA approximation)

Invariant distribution of full system given by P

  • λ1 = k1

k4 , λ2 = k1(k3+k4) k2k4

  • S(∞) ∼ P
  • k1(k2+k3+k4)

k2k4

  • (True invariant distribution)

QSSA error in Poisson intensity k1

k2

Simon Cotter Product form stationary dist. 9 / 35

slide-25
SLIDE 25

QSSA: Simple Example

k1

− − − − → S

k2k4/(k2+k3)s

− − − − − − − − − → ∅ Quantify error by computing error in invariant distribution of S = X1 + X2 S(∞) ∼ P k1(k2 + k3) k2k4

  • (QSSA approximation)

Invariant distribution of full system given by P

  • λ1 = k1

k4 , λ2 = k1(k3+k4) k2k4

  • S(∞) ∼ P
  • k1(k2+k3+k4)

k2k4

  • (True invariant distribution)

QSSA error in Poisson intensity k1

k2

Simon Cotter Product form stationary dist. 9 / 35

slide-26
SLIDE 26

Outline

1

Introduction

2

The Quasi Steady-State Assumption

3

The Constrained Approach

4

Product Form Stationary Distributions for Non-Mass Action Kinetics

5

Numerical Example

6

Conclusions

Simon Cotter Product form stationary dist. 9 / 35

slide-27
SLIDE 27

The Constrained Approach

The Constrained philosophy The assumption is that the fast variables equilibrate on a timescale which is negligible with respect to the rate of change of slow species, but that the invariant distribution of the fast variables can be affected by the slow reactions. Slow stoichiometries are not in general perpendicular to the fast stoichiometries! In practice We cannot approximate P(F|S) by considering just the fast subsystem, as we need to take into account the effect of the slow reactions on the invariant distribution of the fast variables. This can be approximated by considering the dynamics of the full system, constrained to a particular value of the slow variables. NB: Assymptotically (in the limit of large timescale gaps), this approach is in agreement with the QSSA

Simon Cotter Product form stationary dist. 10 / 35

slide-28
SLIDE 28

The Constrained Approach

The Constrained philosophy The assumption is that the fast variables equilibrate on a timescale which is negligible with respect to the rate of change of slow species, but that the invariant distribution of the fast variables can be affected by the slow reactions. Slow stoichiometries are not in general perpendicular to the fast stoichiometries! In practice We cannot approximate P(F|S) by considering just the fast subsystem, as we need to take into account the effect of the slow reactions on the invariant distribution of the fast variables. This can be approximated by considering the dynamics of the full system, constrained to a particular value of the slow variables. NB: Assymptotically (in the limit of large timescale gaps), this approach is in agreement with the QSSA

Simon Cotter Product form stationary dist. 10 / 35

slide-29
SLIDE 29

The Constrained Approach

The Constrained philosophy The assumption is that the fast variables equilibrate on a timescale which is negligible with respect to the rate of change of slow species, but that the invariant distribution of the fast variables can be affected by the slow reactions. Slow stoichiometries are not in general perpendicular to the fast stoichiometries! In practice We cannot approximate P(F|S) by considering just the fast subsystem, as we need to take into account the effect of the slow reactions on the invariant distribution of the fast variables. This can be approximated by considering the dynamics of the full system, constrained to a particular value of the slow variables. NB: Assymptotically (in the limit of large timescale gaps), this approach is in agreement with the QSSA

Simon Cotter Product form stationary dist. 10 / 35

slide-30
SLIDE 30

The Constrained Approach

R1 : ν1 → ν′

1,

R2 : ν2 → ν′

2,

. . . RM : νM → ν′

M,

Pick slow variable S =

i aijXi which is invariant with respect

to fast reactions, i.e. perpendicular to fast stoichiometries Form basis with the slow variables, along with chosen fast variables F Define constrained stoichiometric projector P : Rd → Rd P([S, F]) = [0, F]

Simon Cotter Product form stationary dist. 11 / 35

slide-31
SLIDE 31

The Constrained Approach

R1 : ν1 → ν′

1,

R2 : ν2 → ν′

2,

. . . RM : νM → ν′

M,

Pick slow variable S =

i aijXi which is invariant with respect

to fast reactions, i.e. perpendicular to fast stoichiometries Form basis with the slow variables, along with chosen fast variables F Define constrained stoichiometric projector P : Rd → Rd P([S, F]) = [0, F]

Simon Cotter Product form stationary dist. 11 / 35

slide-32
SLIDE 32

The Constrained Approach

R1 : ν1 → ν′

1,

R2 : ν2 → ν′

2,

. . . RM : νM → ν′

M,

Pick slow variable S =

i aijXi which is invariant with respect

to fast reactions, i.e. perpendicular to fast stoichiometries Form basis with the slow variables, along with chosen fast variables F Define constrained stoichiometric projector P : Rd → Rd P([S, F]) = [0, F]

Simon Cotter Product form stationary dist. 11 / 35

slide-33
SLIDE 33

The Constrained Approach

R1 : ν1 → ν′

1,

R2 : ν2 → ν′

2,

. . . RM : νM → ν′

M,

Pick slow variable S =

i aijXi which is invariant with respect

to fast reactions, i.e. perpendicular to fast stoichiometries Form basis with the slow variables, along with chosen fast variables F Define constrained stoichiometric projector P : Rd → Rd P([S, F]) = [0, F]

Simon Cotter Product form stationary dist. 11 / 35

slide-34
SLIDE 34

The Constrained Subsystem

R1 : ν1 → ν1 + P(ν′

1 − ν1) = ˆ

ν1, R2 : ν2 → ν2 + P(ν′

2 − ν2) = ˆ

ν2, . . . RM : νM → νM + P(ν′

M − νM) = ˆ

νM. Preserves changes to fast variables, removes changes to slow variables Multiply propensities by ✶X+P(ν′

k−νk)∈Zd 0 to preserve

non-negativity Constrains the slow variable to its starting value Invariant distribution a good approximation of P(F|S) for full system Invariant distribution of constrained system needs to be found

Simon Cotter Product form stationary dist. 12 / 35

slide-35
SLIDE 35

The Constrained Subsystem

R1 : ν1 → ν1 + P(ν′

1 − ν1) = ˆ

ν1, R2 : ν2 → ν2 + P(ν′

2 − ν2) = ˆ

ν2, . . . RM : νM → νM + P(ν′

M − νM) = ˆ

νM. Preserves changes to fast variables, removes changes to slow variables Multiply propensities by ✶X+P(ν′

k−νk)∈Zd 0 to preserve

non-negativity Constrains the slow variable to its starting value Invariant distribution a good approximation of P(F|S) for full system Invariant distribution of constrained system needs to be found

Simon Cotter Product form stationary dist. 12 / 35

slide-36
SLIDE 36

The Constrained Subsystem

R1 : ν1 → ν1 + P(ν′

1 − ν1) = ˆ

ν1, R2 : ν2 → ν2 + P(ν′

2 − ν2) = ˆ

ν2, . . . RM : νM → νM + P(ν′

M − νM) = ˆ

νM. Preserves changes to fast variables, removes changes to slow variables Multiply propensities by ✶X+P(ν′

k−νk)∈Zd 0 to preserve

non-negativity Constrains the slow variable to its starting value Invariant distribution a good approximation of P(F|S) for full system Invariant distribution of constrained system needs to be found

Simon Cotter Product form stationary dist. 12 / 35

slide-37
SLIDE 37

The Constrained Subsystem

R1 : ν1 → ν1 + P(ν′

1 − ν1) = ˆ

ν1, R2 : ν2 → ν2 + P(ν′

2 − ν2) = ˆ

ν2, . . . RM : νM → νM + P(ν′

M − νM) = ˆ

νM. Preserves changes to fast variables, removes changes to slow variables Multiply propensities by ✶X+P(ν′

k−νk)∈Zd 0 to preserve

non-negativity Constrains the slow variable to its starting value Invariant distribution a good approximation of P(F|S) for full system Invariant distribution of constrained system needs to be found

Simon Cotter Product form stationary dist. 12 / 35

slide-38
SLIDE 38

The Constrained Subsystem

R1 : ν1 → ν1 + P(ν′

1 − ν1) = ˆ

ν1, R2 : ν2 → ν2 + P(ν′

2 − ν2) = ˆ

ν2, . . . RM : νM → νM + P(ν′

M − νM) = ˆ

νM. Preserves changes to fast variables, removes changes to slow variables Multiply propensities by ✶X+P(ν′

k−νk)∈Zd 0 to preserve

non-negativity Constrains the slow variable to its starting value Invariant distribution a good approximation of P(F|S) for full system Invariant distribution of constrained system needs to be found

Simon Cotter Product form stationary dist. 12 / 35

slide-39
SLIDE 39

The Constrained Subsystem

R1 : ν1 → ν1 + P(ν′

1 − ν1) = ˆ

ν1, R2 : ν2 → ν2 + P(ν′

2 − ν2) = ˆ

ν2, . . . RM : νM → νM + P(ν′

M − νM) = ˆ

νM. Preserves changes to fast variables, removes changes to slow variables Multiply propensities by ✶X+P(ν′

k−νk)∈Zd 0 to preserve

non-negativity Constrains the slow variable to its starting value Invariant distribution a good approximation of P(F|S) for full system Invariant distribution of constrained system needs to be found

Simon Cotter Product form stationary dist. 12 / 35

slide-40
SLIDE 40

Constrained Approach: Simple Example

Consider the system: ∅

k1

− − − − → X1

k2x1

− − − − → ← − − − −

k3x2

X2

k4x2

− − − − → ∅ First construct basis made up of slow/fast variables S = X1 + X2, F = X1

  • r

F = X2 We will pick F = X2 Therefore P([X1, X2]) = [−X2, X2] Apply to all reactions to arrive at constrained subsystem

Simon Cotter Product form stationary dist. 13 / 35

slide-41
SLIDE 41

Constrained Approach: Simple Example

Consider the system: ∅

k1

− − − − → X1

k2x1

− − − − → ← − − − −

k3x2

X2

k4x2

− − − − → ∅ First construct basis made up of slow/fast variables S = X1 + X2, F = X1

  • r

F = X2 We will pick F = X2 Therefore P([X1, X2]) = [−X2, X2] Apply to all reactions to arrive at constrained subsystem

Simon Cotter Product form stationary dist. 13 / 35

slide-42
SLIDE 42

Constrained Approach: Simple Example

Consider the system: ∅

k1

− − − − → X1

k2x1

− − − − → ← − − − −

k3x2

X2

k4x2

− − − − → ∅ First construct basis made up of slow/fast variables S = X1 + X2, F = X1

  • r

F = X2 We will pick F = X2 Therefore P([X1, X2]) = [−X2, X2] Apply to all reactions to arrive at constrained subsystem

Simon Cotter Product form stationary dist. 13 / 35

slide-43
SLIDE 43

Constrained Approach: Simple Example

Consider the system: ∅

k1

− − − − → X1

k2x1

− − − − → ← − − − −

k3x2

X2

k4x2

− − − − → ∅ First construct basis made up of slow/fast variables S = X1 + X2, F = X1

  • r

F = X2 We will pick F = X2 Therefore P([X1, X2]) = [−X2, X2] Apply to all reactions to arrive at constrained subsystem

Simon Cotter Product form stationary dist. 13 / 35

slide-44
SLIDE 44

Constrained Approach: Simple Example

Consider the system: ∅

k1

− − − − → X1

k2x1

− − − − → ← − − − −

k3x2

X2

k4x2

− − − − → ∅ First construct basis made up of slow/fast variables S = X1 + X2, F = X1

  • r

F = X2 We will pick F = X2 Therefore P([X1, X2]) = [−X2, X2] Apply to all reactions to arrive at constrained subsystem

Simon Cotter Product form stationary dist. 13 / 35

slide-45
SLIDE 45

Constrained Approach: Simple Example

Reaction 1: R1 : ∅

k1

− − − − → X1

P([1, 0]) = [0, 0] Constrained version of R1 has no effect on X

Reactions 2,3: R2, R3 : X1

k2x1

− − − − → ← − − − −

k3x2

X2

No change in S Projection has no effect

Reaction 4: R4 : X2

k4x2

− − − − → ∅

P([0, −1]) = [1, −1] Constrained version: R4 : X2

k4x2

− − − − − → X1

Simon Cotter Product form stationary dist. 14 / 35

slide-46
SLIDE 46

Constrained Approach: Simple Example

Reaction 1: R1 : ∅

k1

− − − − → X1

P([1, 0]) = [0, 0] Constrained version of R1 has no effect on X

Reactions 2,3: R2, R3 : X1

k2x1

− − − − → ← − − − −

k3x2

X2

No change in S Projection has no effect

Reaction 4: R4 : X2

k4x2

− − − − → ∅

P([0, −1]) = [1, −1] Constrained version: R4 : X2

k4x2

− − − − − → X1

Simon Cotter Product form stationary dist. 14 / 35

slide-47
SLIDE 47

Constrained Approach: Simple Example

Reaction 1: R1 : ∅

k1

− − − − → X1

P([1, 0]) = [0, 0] Constrained version of R1 has no effect on X

Reactions 2,3: R2, R3 : X1

k2x1

− − − − → ← − − − −

k3x2

X2

No change in S Projection has no effect

Reaction 4: R4 : X2

k4x2

− − − − → ∅

P([0, −1]) = [1, −1] Constrained version: R4 : X2

k4x2

− − − − − → X1

Simon Cotter Product form stationary dist. 14 / 35

slide-48
SLIDE 48

Constrained Approach: Simple Example

Reaction 1: R1 : ∅

k1

− − − − → X1

P([1, 0]) = [0, 0] Constrained version of R1 has no effect on X

Reactions 2,3: R2, R3 : X1

k2x1

− − − − → ← − − − −

k3x2

X2

No change in S Projection has no effect

Reaction 4: R4 : X2

k4x2

− − − − → ∅

P([0, −1]) = [1, −1] Constrained version: R4 : X2

k4x2

− − − − − → X1

Simon Cotter Product form stationary dist. 14 / 35

slide-49
SLIDE 49

Constrained Approach: Simple Example

Reaction 1: R1 : ∅

k1

− − − − → X1

P([1, 0]) = [0, 0] Constrained version of R1 has no effect on X

Reactions 2,3: R2, R3 : X1

k2x1

− − − − → ← − − − −

k3x2

X2

No change in S Projection has no effect

Reaction 4: R4 : X2

k4x2

− − − − → ∅

P([0, −1]) = [1, −1] Constrained version: R4 : X2

k4x2

− − − − − → X1

Simon Cotter Product form stationary dist. 14 / 35

slide-50
SLIDE 50

Constrained Approach: Simple Example

Reaction 1: R1 : ∅

k1

− − − − → X1

P([1, 0]) = [0, 0] Constrained version of R1 has no effect on X

Reactions 2,3: R2, R3 : X1

k2x1

− − − − → ← − − − −

k3x2

X2

No change in S Projection has no effect

Reaction 4: R4 : X2

k4x2

− − − − → ∅

P([0, −1]) = [1, −1] Constrained version: R4 : X2

k4x2

− − − − − → X1

Simon Cotter Product form stationary dist. 14 / 35

slide-51
SLIDE 51

Constrained Approach: Simple Example

Reaction 1: R1 : ∅

k1

− − − − → X1

P([1, 0]) = [0, 0] Constrained version of R1 has no effect on X

Reactions 2,3: R2, R3 : X1

k2x1

− − − − → ← − − − −

k3x2

X2

No change in S Projection has no effect

Reaction 4: R4 : X2

k4x2

− − − − → ∅

P([0, −1]) = [1, −1] Constrained version: R4 : X2

k4x2

− − − − − → X1

Simon Cotter Product form stationary dist. 14 / 35

slide-52
SLIDE 52

Constrained Approach: Simple Example

Reaction 1: R1 : ∅

k1

− − − − → X1

P([1, 0]) = [0, 0] Constrained version of R1 has no effect on X

Reactions 2,3: R2, R3 : X1

k2x1

− − − − → ← − − − −

k3x2

X2

No change in S Projection has no effect

Reaction 4: R4 : X2

k4x2

− − − − → ∅

P([0, −1]) = [1, −1] Constrained version: R4 : X2

k4x2

− − − − − → X1

Simon Cotter Product form stationary dist. 14 / 35

slide-53
SLIDE 53

Constrained Approach: Simple Example

Reaction 1: R1 : ∅

k1

− − − − → X1

P([1, 0]) = [0, 0] Constrained version of R1 has no effect on X

Reactions 2,3: R2, R3 : X1

k2x1

− − − − → ← − − − −

k3x2

X2

No change in S Projection has no effect

Reaction 4: R4 : X2

k4x2

− − − − → ∅

P([0, −1]) = [1, −1] Constrained version: R4 : X2

k4x2

− − − − − → X1

Simon Cotter Product form stationary dist. 14 / 35

slide-54
SLIDE 54

Constrained Approach: Simple Example

X1

k2x1

− − − − − − − → ← − − − − − − −

(k3+k4)x2

X2, S = X1 + X2 Invariant distribution X2 ∼ B(S, λ2) = π(X2) [λ1, λ2] =

  • (k3+k4)

k2+k3+k4 , k2 k2+k3+k4

  • steady state solution of mean field

ODE: k2λ1 = (k3 + k4)λ2, λ1 + λ2 = 1 Compute expectation of the rate of reaction R4 ˆ α4 = E(α4|S) = k4E(X2|S) = k2k4S k2 + k3 + k4

Simon Cotter Product form stationary dist. 15 / 35

slide-55
SLIDE 55

Constrained Approach: Simple Example

X1

k2x1

− − − − − − − → ← − − − − − − −

(k3+k4)x2

X2, S = X1 + X2 Invariant distribution X2 ∼ B(S, λ2) = π(X2) [λ1, λ2] =

  • (k3+k4)

k2+k3+k4 , k2 k2+k3+k4

  • steady state solution of mean field

ODE: k2λ1 = (k3 + k4)λ2, λ1 + λ2 = 1 Compute expectation of the rate of reaction R4 ˆ α4 = E(α4|S) = k4E(X2|S) = k2k4S k2 + k3 + k4

Simon Cotter Product form stationary dist. 15 / 35

slide-56
SLIDE 56

Constrained Approach: Simple Example

X1

k2x1

− − − − − − − → ← − − − − − − −

(k3+k4)x2

X2, S = X1 + X2 Invariant distribution X2 ∼ B(S, λ2) = π(X2) [λ1, λ2] =

  • (k3+k4)

k2+k3+k4 , k2 k2+k3+k4

  • steady state solution of mean field

ODE: k2λ1 = (k3 + k4)λ2, λ1 + λ2 = 1 Compute expectation of the rate of reaction R4 ˆ α4 = E(α4|S) = k4E(X2|S) = k2k4S k2 + k3 + k4

Simon Cotter Product form stationary dist. 15 / 35

slide-57
SLIDE 57

Constrained Approach: Simple Example

k1

− − − − → S

k2k4/(k2+k3+k4)s

− − − − − − − − − − − → ∅ To compare with QSSA, compute invariant distribution S(∞) ∼ P k1(k2 + k3 + k4) k2k4

  • (Constrained approximation)

Invariant distribution identical to true invariant distribution of S = X1 + X2

Simon Cotter Product form stationary dist. 16 / 35

slide-58
SLIDE 58

Constrained Approach: Simple Example

k1

− − − − → S

k2k4/(k2+k3+k4)s

− − − − − − − − − − − → ∅ To compare with QSSA, compute invariant distribution S(∞) ∼ P k1(k2 + k3 + k4) k2k4

  • (Constrained approximation)

Invariant distribution identical to true invariant distribution of S = X1 + X2

Simon Cotter Product form stationary dist. 16 / 35

slide-59
SLIDE 59

Constrained Approach: Simple Example

k1

− − − − → S

k2k4/(k2+k3+k4)s

− − − − − − − − − − − → ∅ To compare with QSSA, compute invariant distribution S(∞) ∼ P k1(k2 + k3 + k4) k2k4

  • (Constrained approximation)

Invariant distribution identical to true invariant distribution of S = X1 + X2

Simon Cotter Product form stationary dist. 16 / 35

slide-60
SLIDE 60

Simple Example

S = X1 + X2 20 40 60 80 100 Probability Mass 0.01 0.02 0.03 0.04 0.05 0.06 0.07

Full generator QSSA generator CMA generator

SLC, “Constrained Approximation of Effective Generators for Multiscale Stochastic Reaction Networks and Application to Conditioned Path Sampling”, in review.

Simon Cotter Product form stationary dist. 17 / 35

slide-61
SLIDE 61

Outline

1

Introduction

2

The Quasi Steady-State Assumption

3

The Constrained Approach

4

Product Form Stationary Distributions for Non-Mass Action Kinetics

5

Numerical Example

6

Conclusions

Simon Cotter Product form stationary dist. 17 / 35

slide-62
SLIDE 62

Some Network Properties: Complexes

S1 + S2

k

− → S3 S1 + S2 reactant complex S3 product complex C number of complexes in network 2S1

k1X1(X1−1)

− − − − → ← − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, C = 4

Simon Cotter Product form stationary dist. 18 / 35

slide-63
SLIDE 63

Some Network Properties: Complexes

S1 + S2

k

− → S3 S1 + S2 reactant complex S3 product complex C number of complexes in network 2S1

k1X1(X1−1)

− − − − → ← − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, C = 4

Simon Cotter Product form stationary dist. 18 / 35

slide-64
SLIDE 64

Some Network Properties: Complexes

S1 + S2

k

− → S3 S1 + S2 reactant complex S3 product complex C number of complexes in network 2S1

k1X1(X1−1)

− − − − → ← − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, C = 4

Simon Cotter Product form stationary dist. 18 / 35

slide-65
SLIDE 65

Some Network Properties: Complexes

S1 + S2

k

− → S3 S1 + S2 reactant complex S3 product complex C number of complexes in network 2S1

k1X1(X1−1)

− − − − → ← − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, C = 4

Simon Cotter Product form stationary dist. 18 / 35

slide-66
SLIDE 66

Some Network Properties: Complexes

S1 + S2

k

− → S3 S1 + S2 reactant complex S3 product complex C number of complexes in network 2S1

k1X1(X1−1)

− − − − → ← − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, C = 4

Simon Cotter Product form stationary dist. 18 / 35

slide-67
SLIDE 67

Some Network Properties: Complexes

S1 + S2

k

− → S3 S1 + S2 reactant complex S3 product complex C number of complexes in network 2S1

k1X1(X1−1)

− − − − → ← − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, C = 4

Simon Cotter Product form stationary dist. 18 / 35

slide-68
SLIDE 68

Some Network Properties: Linkage Classes

Network can be represented uniquely by graph with C nodes 2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, 2S1 S2 ∅ S1 Each connected graph is a linkage class l number of linkage classes (in this example l = 1)

Simon Cotter Product form stationary dist. 19 / 35

slide-69
SLIDE 69

Some Network Properties: Linkage Classes

Network can be represented uniquely by graph with C nodes 2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, 2S1 S2 ∅ S1 Each connected graph is a linkage class l number of linkage classes (in this example l = 1)

Simon Cotter Product form stationary dist. 19 / 35

slide-70
SLIDE 70

Some Network Properties: Linkage Classes

Network can be represented uniquely by graph with C nodes 2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, 2S1 S2 ∅ S1 Each connected graph is a linkage class l number of linkage classes (in this example l = 1)

Simon Cotter Product form stationary dist. 19 / 35

slide-71
SLIDE 71

Some Network Properties: Linkage Classes

Network can be represented uniquely by graph with C nodes 2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, 2S1 S2 ∅ S1 Each connected graph is a linkage class l number of linkage classes (in this example l = 1)

Simon Cotter Product form stationary dist. 19 / 35

slide-72
SLIDE 72

Some Network Properties: Linkage Classes

Network can be represented uniquely by graph with C nodes 2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, 2S1 S2 ∅ S1 Each connected graph is a linkage class l number of linkage classes (in this example l = 1)

Simon Cotter Product form stationary dist. 19 / 35

slide-73
SLIDE 73

Some Network Properties: Stoichiometric Subspace

Denote each reaction as: νm − − − − → ν′

m

Stochiometric subspace given by: S = spanm{νm − ν′

m}

Denote s = dim(S)

Simon Cotter Product form stationary dist. 20 / 35

slide-74
SLIDE 74

Some Network Properties: Stoichiometric Subspace

Denote each reaction as: νm − − − − → ν′

m

Stochiometric subspace given by: S = spanm{νm − ν′

m}

Denote s = dim(S)

Simon Cotter Product form stationary dist. 20 / 35

slide-75
SLIDE 75

Some Network Properties: Stoichiometric Subspace

Denote each reaction as: νm − − − − → ν′

m

Stochiometric subspace given by: S = spanm{νm − ν′

m}

Denote s = dim(S)

Simon Cotter Product form stationary dist. 20 / 35

slide-76
SLIDE 76

Some Network Properties: Deficiency Zero

Deficiency δ = C − l − s 2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, δ = 4 − 1 − 2 = 1 Networks with deficiency zero have certain properties and are well studied

Simon Cotter Product form stationary dist. 21 / 35

slide-77
SLIDE 77

Some Network Properties: Deficiency Zero

Deficiency δ = C − l − s 2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, δ = 4 − 1 − 2 = 1 Networks with deficiency zero have certain properties and are well studied

Simon Cotter Product form stationary dist. 21 / 35

slide-78
SLIDE 78

Some Network Properties: Deficiency Zero

Deficiency δ = C − l − s 2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, δ = 4 − 1 − 2 = 1 Networks with deficiency zero have certain properties and are well studied

Simon Cotter Product form stationary dist. 21 / 35

slide-79
SLIDE 79

Some Network Properties: Weak Reversibility

ODE models of zero deficiency weakly reversible networks have a unique complex balance (steady-state of the ODE) System is reversible if all reactions are reversible 1 2 3 4 5 C1 C2 C3 C4 C5

Simon Cotter Product form stationary dist. 22 / 35

slide-80
SLIDE 80

Some Network Properties: Weak Reversibility

ODE models of zero deficiency weakly reversible networks have a unique complex balance (steady-state of the ODE) System is reversible if all reactions are reversible 1 2 3 4 5 C1 C2 C3 C4 C5

Simon Cotter Product form stationary dist. 22 / 35

slide-81
SLIDE 81

Some Network Properties: Weak Reversibility

ODE models of zero deficiency weakly reversible networks have a unique complex balance (steady-state of the ODE) System is reversible if all reactions are reversible 1 2 3 4 5 C1 C2 C3 C4 C5

Simon Cotter Product form stationary dist. 22 / 35

slide-82
SLIDE 82

Some Network Properties: Weak Reversibility

ODE models of zero deficiency weakly reversible networks have a unique complex balance (steady-state of the ODE) System is reversible if all reactions are reversible 1 2 3 4 5 C1 C2 C3 C4 C5

Simon Cotter Product form stationary dist. 22 / 35

slide-83
SLIDE 83

Some Network Properties: Weak Reversibility

ODE models of zero deficiency weakly reversible networks have a unique complex balance (steady-state of the ODE) System is reversible if all reactions are reversible 1 2 3 4 5 C1 C2 C3 C4 C5

Simon Cotter Product form stationary dist. 22 / 35

slide-84
SLIDE 84

Some Network Properties: Weak Reversibility

ODE models of zero deficiency weakly reversible networks have a unique complex balance (steady-state of the ODE) System is reversible if all reactions are reversible 1 2 3 4 5 C1 C2 C3 C4 C5

Simon Cotter Product form stationary dist. 22 / 35

slide-85
SLIDE 85

Some Network Properties: Weak Reversibility

ODE models of zero deficiency weakly reversible networks have a unique complex balance (steady-state of the ODE) System is reversible if all reactions are reversible 1 2 3 4 5 C1 C2 C3 C4 C5

Simon Cotter Product form stationary dist. 22 / 35

slide-86
SLIDE 86

Preliminaries: form of intensity functions

The theorem that follows relies on the following form of the intensity/hazard functions αm(x) = km

d

  • i=1

νmi−1

  • j=0

θi(xi − j), Mass action kinetics if θ is the identity

Simon Cotter Product form stationary dist. 23 / 35

slide-87
SLIDE 87

Preliminaries: form of intensity functions

The theorem that follows relies on the following form of the intensity/hazard functions αm(x) = km

d

  • i=1

νmi−1

  • j=0

θi(xi − j), Mass action kinetics if θ is the identity

Simon Cotter Product form stationary dist. 23 / 35

slide-88
SLIDE 88

Preliminaries: form of intensity functions

The theorem that follows relies on the following form of the intensity/hazard functions αm(x) = km

d

  • i=1

νmi−1

  • j=0

θi(xi − j), Mass action kinetics if θ is the identity

Simon Cotter Product form stationary dist. 23 / 35

slide-89
SLIDE 89

Product Form Stationary Distributions

Theorem (Anderson, Craciun, Kurtz, 2010) Let {S, C, R} be a zero deficiency, weakly reversible reaction

  • network. Modeled deterministically with mass action kinetics and

rate constants km the system has complex balanced equilibrium c ∈ Rd

>0. Then, the stochastically modeled system with the

specified intensity functions admits the invariant measure on each stoichiometric class π(x) ∝

d

  • i=1

cxi

i

xi−1

j=0 θi(xi − j)

. The measure π can be normalized to a stationary distribution so long as it is summable.

Simon Cotter Product form stationary dist. 24 / 35

slide-90
SLIDE 90

Motivating Example for New Result

2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, Multiscale system with reversible dimerisation reactions fast Consider the constrained fast subsystem with slow variable S = X1 + 2X2 2S1

k1X1(X1−1)+k3✶{X1>1}

− − − − − − − − − − − → ← − − − − − − − − − − −

(k2+k4)X2

S2, Intensity functions do not satisfy the assumptions of the existing results

Simon Cotter Product form stationary dist. 25 / 35

slide-91
SLIDE 91

Motivating Example for New Result

2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, Multiscale system with reversible dimerisation reactions fast Consider the constrained fast subsystem with slow variable S = X1 + 2X2 2S1

k1X1(X1−1)+k3✶{X1>1}

− − − − − − − − − − − → ← − − − − − − − − − − −

(k2+k4)X2

S2, Intensity functions do not satisfy the assumptions of the existing results

Simon Cotter Product form stationary dist. 25 / 35

slide-92
SLIDE 92

Motivating Example for New Result

2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, Multiscale system with reversible dimerisation reactions fast Consider the constrained fast subsystem with slow variable S = X1 + 2X2 2S1

k1X1(X1−1)+k3✶{X1>1}

− − − − − − − − − − − → ← − − − − − − − − − − −

(k2+k4)X2

S2, Intensity functions do not satisfy the assumptions of the existing results

Simon Cotter Product form stationary dist. 25 / 35

slide-93
SLIDE 93

Motivating Example for New Result

2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, Multiscale system with reversible dimerisation reactions fast Consider the constrained fast subsystem with slow variable S = X1 + 2X2 2S1

k1X1(X1−1)+k3✶{X1>1}

− − − − − − − − − − − → ← − − − − − − − − − − −

(k2+k4)X2

S2, Intensity functions do not satisfy the assumptions of the existing results

Simon Cotter Product form stationary dist. 25 / 35

slide-94
SLIDE 94

Motivating Example for New Result

2S1

k1X1(X1−1)

− − − − − − − → ← − − − − − − −

k2X2

S2, ∅

k3

− − − − → S2, S1

k4X1

− − − − → ∅, Multiscale system with reversible dimerisation reactions fast Consider the constrained fast subsystem with slow variable S = X1 + 2X2 2S1

k1X1(X1−1)+k3✶{X1>1}

− − − − − − − − − − − → ← − − − − − − − − − − −

(k2+k4)X2

S2, Intensity functions do not satisfy the assumptions of the existing results

Simon Cotter Product form stationary dist. 25 / 35

slide-95
SLIDE 95

New Structural Assumption

Partition all species S = {S1, S2, . . . , SN} into S1 and S2. Si ∈ S2 if for some ηi ≥ 2 we have that νki is always some nonnegative multiple of ηi For all other Si ∈ S1, let ηi = 1. Assume that all intensity functions satisfy: αm(x) = km

d

  • i=1

νmi ηi −1

  • j=0

θi(Xi − jηi), where κk > 0 and θi(xi) = 0 if and only if xi ≤ αi − 1.

Simon Cotter Product form stationary dist. 26 / 35

slide-96
SLIDE 96

New Structural Assumption

Partition all species S = {S1, S2, . . . , SN} into S1 and S2. Si ∈ S2 if for some ηi ≥ 2 we have that νki is always some nonnegative multiple of ηi For all other Si ∈ S1, let ηi = 1. Assume that all intensity functions satisfy: αm(x) = km

d

  • i=1

νmi ηi −1

  • j=0

θi(Xi − jηi), where κk > 0 and θi(xi) = 0 if and only if xi ≤ αi − 1.

Simon Cotter Product form stationary dist. 26 / 35

slide-97
SLIDE 97

New Structural Assumption

Partition all species S = {S1, S2, . . . , SN} into S1 and S2. Si ∈ S2 if for some ηi ≥ 2 we have that νki is always some nonnegative multiple of ηi For all other Si ∈ S1, let ηi = 1. Assume that all intensity functions satisfy: αm(x) = km

d

  • i=1

νmi ηi −1

  • j=0

θi(Xi − jηi), where κk > 0 and θi(xi) = 0 if and only if xi ≤ αi − 1.

Simon Cotter Product form stationary dist. 26 / 35

slide-98
SLIDE 98

New Structural Assumption

Partition all species S = {S1, S2, . . . , SN} into S1 and S2. Si ∈ S2 if for some ηi ≥ 2 we have that νki is always some nonnegative multiple of ηi For all other Si ∈ S1, let ηi = 1. Assume that all intensity functions satisfy: αm(x) = km

d

  • i=1

νmi ηi −1

  • j=0

θi(Xi − jηi), where κk > 0 and θi(xi) = 0 if and only if xi ≤ αi − 1.

Simon Cotter Product form stationary dist. 26 / 35

slide-99
SLIDE 99

New Structural Assumption

Partition all species S = {S1, S2, . . . , SN} into S1 and S2. Si ∈ S2 if for some ηi ≥ 2 we have that νki is always some nonnegative multiple of ηi For all other Si ∈ S1, let ηi = 1. Assume that all intensity functions satisfy: αm(x) = km

d

  • i=1

νmi ηi −1

  • j=0

θi(Xi − jηi), where κk > 0 and θi(xi) = 0 if and only if xi ≤ αi − 1.

Simon Cotter Product form stationary dist. 26 / 35

slide-100
SLIDE 100

Theorem: Product Form Stationary Distributions

Theorem (Anderson, Cotter, 2016) Let {S1 ∪ S2, C, R} be a zero deficiency, weakly reversible reaction network satisfying the above assumption. Modeled deterministically with mass action kinetics and rate constants km the system has complex balanced equilibrium c ∈ Rd

>0. Then, the

stochastically modeled system with the specified intensity functions admits the invariant measure on each stoichiometric class π(x) ∝

d

  • i=1

cXi

i

⌊Xi/ηi⌋−1

j=0

θi(Xi − jηi) . The measure π can be normalized to a stationary distribution so long as it is summable.

Simon Cotter Product form stationary dist. 27 / 35

slide-101
SLIDE 101

Outline

1

Introduction

2

The Quasi Steady-State Assumption

3

The Constrained Approach

4

Product Form Stationary Distributions for Non-Mass Action Kinetics

5

Numerical Example

6

Conclusions

Simon Cotter Product form stationary dist. 27 / 35

slide-102
SLIDE 102

Bistable Example

R1, R2 : X2

k1x2

− − − − → ← − − − −

k2x1x2

X1 + X2, R3, R4 : ∅

k3

− − − − → ← − − − −

k4x1

X1, R5, R6 : X1 + X1

k5x1(x1−1)

− − − − → ← − − − −

k6x2

X2, R7 : X2

k7x2

− − − − → ∅. In certain parameter regimes:

Reactions R5, R6 are most frequent Invariant distribution is bimodal

Simon Cotter Product form stationary dist. 28 / 35

slide-103
SLIDE 103

Bistable Example

R1, R2 : X2

k1x2

− − − − → ← − − − −

k2x1x2

X1 + X2, R3, R4 : ∅

k3

− − − − → ← − − − −

k4x1

X1, R5, R6 : X1 + X1

k5x1(x1−1)

− − − − → ← − − − −

k6x2

X2, R7 : X2

k7x2

− − − − → ∅. In certain parameter regimes:

Reactions R5, R6 are most frequent Invariant distribution is bimodal

Simon Cotter Product form stationary dist. 28 / 35

slide-104
SLIDE 104

Bistable Example

R1, R2 : X2

k1x2

− − − − → ← − − − −

k2x1x2

X1 + X2, R3, R4 : ∅

k3

− − − − → ← − − − −

k4x1

X1, R5, R6 : X1 + X1

k5x1(x1−1)

− − − − → ← − − − −

k6x2

X2, R7 : X2

k7x2

− − − − → ∅. In certain parameter regimes:

Reactions R5, R6 are most frequent Invariant distribution is bimodal

Simon Cotter Product form stationary dist. 28 / 35

slide-105
SLIDE 105

Bistable Example

R1, R2 : X2

k1x2

− − − − → ← − − − −

k2x1x2

X1 + X2, R3, R4 : ∅

k3

− − − − → ← − − − −

k4x1

X1, R5, R6 : X1 + X1

k5x1(x1−1)

− − − − → ← − − − −

k6x2

X2, R7 : X2

k7x2

− − − − → ∅. In certain parameter regimes:

Reactions R5, R6 are most frequent Invariant distribution is bimodal

Simon Cotter Product form stationary dist. 28 / 35

slide-106
SLIDE 106

Bistable Example

Left: Log of the invariant density of the system Right: Plot of α5(X1,X2)+α6(X1,X2)

  • j αj(X1,X2)

(Expectation = 69.41%)

Simon Cotter Product form stationary dist. 29 / 35

slide-107
SLIDE 107

QSSA and Constrained Approaches: Bistable Example

Fast subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

k6x2

X2, S = X1 + 2X2 (QSSA) Slow variable S = X1 + 2X2, pick F = X2 P([X1, X2]) = [−2X2, X2] constrained stoichiometric projector Constrained subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

(k6+k7)x2

X2, S = X1 + 2X2 (Constrained) Use subsystems to approximate effective rates of slow reactions Stationary distributions of the subsystems can be computed via our new result

Simon Cotter Product form stationary dist. 30 / 35

slide-108
SLIDE 108

QSSA and Constrained Approaches: Bistable Example

Fast subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

k6x2

X2, S = X1 + 2X2 (QSSA) Slow variable S = X1 + 2X2, pick F = X2 P([X1, X2]) = [−2X2, X2] constrained stoichiometric projector Constrained subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

(k6+k7)x2

X2, S = X1 + 2X2 (Constrained) Use subsystems to approximate effective rates of slow reactions Stationary distributions of the subsystems can be computed via our new result

Simon Cotter Product form stationary dist. 30 / 35

slide-109
SLIDE 109

QSSA and Constrained Approaches: Bistable Example

Fast subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

k6x2

X2, S = X1 + 2X2 (QSSA) Slow variable S = X1 + 2X2, pick F = X2 P([X1, X2]) = [−2X2, X2] constrained stoichiometric projector Constrained subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

(k6+k7)x2

X2, S = X1 + 2X2 (Constrained) Use subsystems to approximate effective rates of slow reactions Stationary distributions of the subsystems can be computed via our new result

Simon Cotter Product form stationary dist. 30 / 35

slide-110
SLIDE 110

QSSA and Constrained Approaches: Bistable Example

Fast subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

k6x2

X2, S = X1 + 2X2 (QSSA) Slow variable S = X1 + 2X2, pick F = X2 P([X1, X2]) = [−2X2, X2] constrained stoichiometric projector Constrained subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

(k6+k7)x2

X2, S = X1 + 2X2 (Constrained) Use subsystems to approximate effective rates of slow reactions Stationary distributions of the subsystems can be computed via our new result

Simon Cotter Product form stationary dist. 30 / 35

slide-111
SLIDE 111

QSSA and Constrained Approaches: Bistable Example

Fast subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

k6x2

X2, S = X1 + 2X2 (QSSA) Slow variable S = X1 + 2X2, pick F = X2 P([X1, X2]) = [−2X2, X2] constrained stoichiometric projector Constrained subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

(k6+k7)x2

X2, S = X1 + 2X2 (Constrained) Use subsystems to approximate effective rates of slow reactions Stationary distributions of the subsystems can be computed via our new result

Simon Cotter Product form stationary dist. 30 / 35

slide-112
SLIDE 112

QSSA and Constrained Approaches: Bistable Example

Fast subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

k6x2

X2, S = X1 + 2X2 (QSSA) Slow variable S = X1 + 2X2, pick F = X2 P([X1, X2]) = [−2X2, X2] constrained stoichiometric projector Constrained subsystem: X1 + X1

k5x1(x1−1)

− − − − − − − → ← − − − − − − −

(k6+k7)x2

X2, S = X1 + 2X2 (Constrained) Use subsystems to approximate effective rates of slow reactions Stationary distributions of the subsystems can be computed via our new result

Simon Cotter Product form stationary dist. 30 / 35

slide-113
SLIDE 113

Bistable Example

S = X1 + 2X2 100 200 300 400 500 Probability Mass 0.002 0.004 0.006 0.008 0.01 0.012 0.014 0.016 0.018

Approximate full generator QSSA generator CMA generator

Simon Cotter Product form stationary dist. 31 / 35

slide-114
SLIDE 114

Bistable Example

QSSA CMA πΩ Relative l2 error 6.347 × 10−1 1.796 × 10−2

  • LH peak position

20 20 20 LH peak height 5.378 × 10−3 1.591 × 10−2 1.582 × 10−2 RH peak position 309 295 295 RH peak height 6.192 × 10−2 4.060 × 10−3 4.006 × 10−3

Simon Cotter Product form stationary dist. 32 / 35

slide-115
SLIDE 115

Outline

1

Introduction

2

The Quasi Steady-State Assumption

3

The Constrained Approach

4

Product Form Stationary Distributions for Non-Mass Action Kinetics

5

Numerical Example

6

Conclusions

Simon Cotter Product form stationary dist. 32 / 35

slide-116
SLIDE 116

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-117
SLIDE 117

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-118
SLIDE 118

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-119
SLIDE 119

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-120
SLIDE 120

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-121
SLIDE 121

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-122
SLIDE 122

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-123
SLIDE 123

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-124
SLIDE 124

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-125
SLIDE 125

Conclusions

Constrained approach better approximates P(F|S) than QSSA Corrects for the effect of the slow reactions on the distribution

  • f the fast variables

Exact for monomolecular systems Can be applied iteratively, analogous to nested QSSA approaches No need for approximations or expensive simulations Leads to fast, accurate approximations of highly complex systems What constitutes the best choice of basis? Makes conditioned path sampling feasible Used in Bayesian inverse problems Constrained averaging improves reduced ODE models

Simon Cotter Product form stationary dist. 33 / 35

slide-126
SLIDE 126

References

  • D. Anderson & SLC, “Product-form stationary distributions for

deficiency zero networks with non-mass action kinetics” (2016) arXiv preprint arXiv:1605.07042 SLC, “Constrained approximation of effective generators for multiscale stochastic reaction networks and application to conditioned path sampling” (2015) arXiv preprint arXiv:1506.02446. SLC & R. Erban, “Error Analysis of Diffusion Approximation Methods for Multiscale Systems in Reaction Kinetics”, SIAM Journal on Scientific Computing, (2016) 38:1 144-163 10.1137/14100052X SLC, K. Zygalakis, I. Kevrekidis & R. Erban, “A constrained approach to multiscale stochastic simulation of chemically reacting systems”, The Journal of chemical physics, (2011) 135(9), 094102.

Simon Cotter Product form stationary dist. 34 / 35

slide-127
SLIDE 127

Shameless Workshop Plug

Computational Challenges in Biochemical Networks: Multiscale Modelling and Inverse Problems

Tuesday 30th - Wednesday 31st August

The University of Manchester, School of Mathematjcs Alan Turing Building

Speakers: Ruth Baker, Oxford University, UK Simon Cotuer, University of Manchester, UK Radek Erban, Oxford University, UK Ramon Grima, Edinburgh University, UK Michal Komorowski, Polish Academy of Sciences, Poland Linda Petzold, UCSB, US Alexis Boukouvalas, University of Manchester, UK Chris Sherlock, Lancaster University, UK Michael Stumpf, Imperial College, UK Darren Wilkinson, Newcastle University, UK Poster session Register now at: htup://www.maths.manchester.ac.uk/news-and-events/ events/computatjonalchallenges/

Simon Cotter Product form stationary dist. 35 / 35