On The Asymptotic Distribution of Nucleation Times of - - PowerPoint PPT Presentation

on the asymptotic distribution of nucleation times of
SMART_READER_LITE
LIVE PREVIEW

On The Asymptotic Distribution of Nucleation Times of - - PowerPoint PPT Presentation

On The Asymptotic Distribution of Nucleation Times of Polymerization Processes SUN Wen Joint work with Philippe Robert Les probabilit es de demain, Paris, May 2018 Overview Nucleation phenomenon Observations from biological experiments


slide-1
SLIDE 1

On The Asymptotic Distribution of Nucleation Times of Polymerization Processes

SUN Wen Joint work with Philippe Robert Les probabilit´ es de demain, Paris, May 2018

slide-2
SLIDE 2

Overview

Nucleation phenomenon Observations from biological experiments Mathematical literature Model A Markovian model for nucleation Basic Assumptions The math problem Results Main Results Sketch of proofs Future work and references

slide-3
SLIDE 3

Polymerization & Nucleation

small particles

synthesis

− − − − − − − − ⇀ ↽ − − − − − − − −

decomposition Big (stable) clusters.

Figure: Flyvbjerg, Jobs, and Leibler’s model (96’ PNAS)

for the self-assembly of microtubules, retrieved from Morris et al. (09’ Biochimica et Biophysica Acta) ◮ Physics:

Aerosols...

◮ Chemistry:

Polymers/monomers

◮ Biology:

Protein/Peptide v.s. amino acid monomers

slide-4
SLIDE 4

Experiments: large variability in nucleation

10 20 30 40 50 60 70 80 90 100 −0.1 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 1.1 Time (hours) Quantity of Polymers (normalised) 20 40 60 80 100 120 140 160 180 200 220 240

Figure: Experiments for the evolution of polymerized mass.

From data published in Xue et al.(08’ PNAS).

Observations:

◮ sharp curve; ◮ huge variance

in time.

slide-5
SLIDE 5

Goals of our study

◮ Explain sharp phase transition in nucleation; ◮ Explain high variance of the transition moment.

slide-6
SLIDE 6

Literature: coagulation and fragmentation models

◮ Particles are identified by their sizes. ◮ Reactions: for m = n i=1 mi,

  • (m1)+(m2)+ . . . +(mn) → (m)

(coagulation), (m) → (m1)+(m2)+ . . . +(mn) (fragmentation),

◮ Binary reaction: Smoluchowski Model

(i) + (j)

K(i,j)

− − − ⇀ ↽ − − −

F(i,j) (i + j).

where (F(i, j)), (K(i, j)) are reaction rates.

slide-7
SLIDE 7

Literature: coagulation and fragmentation models

◮ Deterministic studies:

Oosawa et al. (75), Ball et al. (86’), Penrose (89’,08’), Jabin et al. (03’), Niethammer (04’) . . .

◮ Stochastic studies:

Jeon (98’), Durrett et al. (99’), Norris (99’), Ranjbar et al. (10’), Bertoin (06’,17’), Calvez et al. (12’), Sun (18’) . . .

◮ Survey:

Aldous (99’), Hingant & Yvinec (16’)

Can not explain the high variance observed in the experiments! (CLT is not enough!)

slide-8
SLIDE 8

Model with the nucleus

◮ Reaction:

    

(1)+(k)

κk

+

− → (k + 1), (k)

κk,a

− → (a1)+(a2)+ · · · +(ap), ∀p≥2, a1+ · · · +ap=k,

◮ Critical Nucleus size: nc ◮ Polymers larger than the nucleus are more stable than the

smaller polymers: ∀s < nc < ℓ, κs

κs

+

≫ κℓ

κℓ

+

. where κk

− = a κk,a − .

slide-9
SLIDE 9

Assumptions & Markovian description

◮ Only monomers at t = 0 with total mass N; ◮ Scaling assumption: for two positive sequences (λk), (µk)

and µ > 0, κk

+ = λk,

κk

− =

  • N µk,

if k<nc µ, if k≥nc

◮ UN k (t) := number of polymers of size k at time t; ◮ Markov process (UN k (t), k ∈ N) with generator

ΩN(f )(u) =

+∞

  • k=1

λkuk u1 N [f (u+ek+1−ek−e1)−f (u)] +

+∞

  • k=2
  • Nµk✶{k<nc} + µ✶{k≥nc}
  • uk
  • Sk

[f (u+y−ek)−f (u)] νk(dy) where (νk) are fragmentation measures and (Sk) are the set of all possible fragmentations.

slide-10
SLIDE 10

Mathematical Interpretation

◮ Lag time: for any fraction δ ∈ (0, 1),

LN

δ := inf{t ≥ 0 :

  • k≥nc

kUN

k (t) ≥ δN}. ◮ Observations in terms of lag time:

10 20 30 40 50 60 70 80 90 100 −0.1 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 1.1 Time (hours) Quantity of Polymers (normalised) 20 40 60 80 100 120 140 160 180 200 220 240

Figure: Xue et al.(08’ PNAS).

◮ sharp phase transition:

for any δ1, δ2 ∈ (0, 1), LN

δ1 ∼ LN δ2 ◮ high variance:

O

  • Var(LN

δ )

  • ∼ O
  • E(LN

δ )

slide-11
SLIDE 11

Main Results (for nc ≥ 3)

◮ The moment of the first nucleus:

T N := inf{t ≥ 0 : UN

nc(t) = 1}.

With high probability, for any δ ∈ (0, δ0), LN

δ ∼ O

  • TN + log(N)
  • .

◮ For the convergence in probability

lim

N→∞

  • T N

Nnc−3

  • = Eρ,

where Eρ is an exponential random variable with parameter ρ only depends on (λk, µk, k ≤ nc − 1).

slide-12
SLIDE 12

Main Results (for nc ≥ 3)

◮ The moment of the first nucleus:

T N := inf{t ≥ 0 : UN

nc(t) = 1}.

With high probability, for any δ ∈ (0, δ0), Therefore, LN

δ ∼ O

  • EρNnc−3 + log(N)
  • .

◮ For the convergence in probability

lim

N→∞

  • T N

Nnc−3

  • = Eρ,

where Eρ is an exponential random variable with parameter ρ only depends on (λk, µk, k ≤ nc − 1).

slide-13
SLIDE 13

Main Results (for nc ≥ 3)

◮ The moment of the first nucleus:

T N := inf{t ≥ 0 : UN

nc(t) = 1}.

With high probability, for any δ ∈ (0, δ0), If nc > 3, LN

δ

Nnc−3 ∼ O (Eρ) ← − Not depends on δ & Large var!

◮ For the convergence in probability

lim

N→∞

  • T N

Nnc−3

  • = Eρ,

where Eρ is an exponential random variable with parameter ρ only depends on (λk, µk, k ≤ nc − 1).

slide-14
SLIDE 14

Sketch of proofs (Step I)

Before T N, UN

k (t) ≡ 0, for all k > nc + 1.

A simple example, Becker-D¨

  • ring reactions:

(1) + (k)

λk

− − − − ⇀ ↽ − − − −

Nµk+1

(k + 1).

UN

1

fast process UN

2

UN

3

· · · λkUN

k UN 1 /N ∼ O(1)UN k

Nµk+1UN

k+1 ∼ O(N)UN k+1 UN

nc −1

UN

nc

slow process

slide-15
SLIDE 15

Sketch of proofs (Step I)

◮ Distribution of T N only depends on the fast-slow system

(UN

1 (t), . . . , UN nc(t)). ◮ Study the dynamic on the very large time interval [0, Nnc−3t]

by using marked Poisson point processes;

◮ Main Difficulties:

◮ very large fluctuations

(Time scale Nnc−3 v.s. Space scale N).

◮ multi-dimensional stochastic averaging system:

hard to identify the limit of occupation measures

◮ Techniques: coupling, flow balance equations... ◮ Proofs work for general fragmentation measures under

reasonable conditions.

slide-16
SLIDE 16

Sketch of proofs (Step II)

After time T N, by coupling, number of stable polymers (UN

nc(t), UN nc+1(t), . . . )

could be lower bounded by a supercritial branching process.

◮ The lag time of the branching process is less than K log N

with probability p0 > 0.

◮ Therefore, stochastically

T N ≤ LN

δ ≤ Gp0

  • i=1

(T N

i

+ K log N) where Gp0 is a geometric random variable.

slide-17
SLIDE 17

Future work

◮ Experiments: fragmentation rates are more likely sublinear for

smaller polymers, i.e., for k small, κk

− = O (Nα) , for an 0 < α < 1.

See the biology review Morris et al. (09’).

◮ In the general case κ−/κ+ ∼ φ(N), the nucleation time

should be O(φ(N)nc−2/N).

◮ Nucleation in a multi-type polymers environment.

slide-18
SLIDE 18

References

◮ (Eug` ene, Xue, Robert & Doumic, 16’) Insights into the variability of

nucleated amyloid polymerization by a minimalistic model of stochastic protein assembly. (Journal of Chemical Physics)

◮ (Doumic, Eug` ene & Robert, 16’) Asymptotics of stochastic protein

assembly models. (SIAM Journal on Applied Mathematics)

◮ (Robert & Sun, 17’) On the Asymptotic Distribution of Nucleation

Times of Polymerization Processes. (arXiv:1712.08347)

slide-19
SLIDE 19

Thank you!