Self-similar growth-fragmentations as scaling limits of Markov - - PowerPoint PPT Presentation

self similar growth fragmentations as scaling limits of
SMART_READER_LITE
LIVE PREVIEW

Self-similar growth-fragmentations as scaling limits of Markov - - PowerPoint PPT Presentation

Self-similar growth-fragmentations as scaling limits of Markov branching processes Benjamin Dadoun Institut fr Mathematik, Universitt Zrich Les probabilits de demain 3 mai 2018 Outline Introduction 1 Motivating example 2


slide-1
SLIDE 1

Self-similar growth-fragmentations as scaling limits

  • f Markov branching processes

Benjamin Dadoun Institut für Mathematik, Universität Zürich Les probabilités de demain 3 mai 2018

slide-2
SLIDE 2

Outline

Introduction

1 Motivating example 2 Self-similar growth-fragmentation 3 Markov branching process 4 Scaling limits 5 Two difficulties induced by growth

Results

6 Assumptions 7 Scaling limit for the process 8 Scaling limit for the tree 9-10 Proof aspects

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction
slide-3
SLIDE 3

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-4
SLIDE 4

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(0) = (7, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-5
SLIDE 5

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(0) = (7, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-6
SLIDE 6

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(0) = (7, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-7
SLIDE 7

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(1) = (8, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-8
SLIDE 8

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(1) = (8, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-9
SLIDE 9

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(1) = (8, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-10
SLIDE 10

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(2) = (8, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-11
SLIDE 11

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(2) = (8, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-12
SLIDE 12

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(3) = (7, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-13
SLIDE 13

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(4) = (7, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-14
SLIDE 14

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(4) = (7, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-15
SLIDE 15

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(5) = (6, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-16
SLIDE 16

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(6) = (6, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-17
SLIDE 17

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(6) = (6, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-18
SLIDE 18

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(7) = (7, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-19
SLIDE 19

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(7) = (7, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-20
SLIDE 20

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(8) = (8, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-21
SLIDE 21

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(8) = (8, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-22
SLIDE 22

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(9) = (7, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-23
SLIDE 23

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(10) = (7, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-24
SLIDE 24

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(10) = (7, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-25
SLIDE 25

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(11) = (4, 4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-26
SLIDE 26

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(12) = (5, 4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-27
SLIDE 27

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(13) = (6, 4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-28
SLIDE 28

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(14) = (7, 4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-29
SLIDE 29

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(15) = (6, 4, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-30
SLIDE 30

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(16) = (6, 4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-31
SLIDE 31

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(17) = (5, 4, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-32
SLIDE 32

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(18) = (5, 4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-33
SLIDE 33

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(19) = (4, 4, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-34
SLIDE 34

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(20) = (4, 4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-35
SLIDE 35

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(21) = (5, 4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-36
SLIDE 36

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(22) = (6, 4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-37
SLIDE 37

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(23) = (4, 4, 3, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-38
SLIDE 38

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(24) = (5, 4, 3, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-39
SLIDE 39

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(25) = (6, 4, 3, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-40
SLIDE 40

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(26) = (5, 4, 3, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-41
SLIDE 41

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(27) = (5, 4, 3, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-42
SLIDE 42

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(28) = (4, 4, 3, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-43
SLIDE 43

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(29) = (4, 4, 3, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-44
SLIDE 44

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(30) = (4, 3, 3, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-45
SLIDE 45

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(31) = (4, 3, 3, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-46
SLIDE 46

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(32) = (4, 3, 2, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-47
SLIDE 47

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(34) = (4, 3, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-48
SLIDE 48

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(35) = (4, 2, 2, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-49
SLIDE 49

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(37) = (4, 1, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-50
SLIDE 50

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(38) = (4, 2, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-51
SLIDE 51

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(39) = (4, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-52
SLIDE 52

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(40) = (5, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-53
SLIDE 53

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(41) = (4, 2, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-54
SLIDE 54

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(42) = (4, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-55
SLIDE 55

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(43) = (5, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-56
SLIDE 56

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(44) = (4, 2, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-57
SLIDE 57

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(45) = (4, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-58
SLIDE 58

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(46) = (3, 2, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-59
SLIDE 59

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(47) = (3, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-60
SLIDE 60

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(48) = (2, 2, 0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-61
SLIDE 61

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Hole perimeters: X (n)(50) = (0, . . .)

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-62
SLIDE 62

Motivating example

Peeling a random Boltzmann triangulation of the n-gon

Fact (Bertoin et al., 2016, 2017).

There is a scaling limit: “   X

(n)(⌊ant⌋)

n : t ≥ 0  

(d)

− − − →

n→∞

Y ”

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

1/10

slide-63
SLIDE 63

Self-similar growth-fragmentation

Y

Y is a positive, self-similar, Markov process

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-64
SLIDE 64

Self-similar growth-fragmentation

Y

self-similar: law of Y under Py = law of yY

  • y−γ·
  • under P1
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-65
SLIDE 65

Self-similar growth-fragmentation

Y∅

self-similar: law of Y under Py = law of yY

  • y−γ·
  • under P1
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-66
SLIDE 66

Self-similar growth-fragmentation

Y∅ x b1

self-similar: law of Y under Py = law of yY

  • y−γ·
  • under P1
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-67
SLIDE 67

Self-similar growth-fragmentation

Y∅ x y −y b1

self-similar: law of Y under Py = law of yY

  • y−γ·
  • under P1
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-68
SLIDE 68

Self-similar growth-fragmentation

Y∅ y b1 Y1

self-similar: law of Y under Py = law of yY

  • y−γ·
  • under P1
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-69
SLIDE 69

Self-similar growth-fragmentation

Y∅ b1 Y1 b2

self-similar: law of Y under Py = law of yY

  • y−γ·
  • under P1
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-70
SLIDE 70

Self-similar growth-fragmentation

Y∅ b1 Y1 b2 Y2

self-similar: law of Y under Py = law of yY

  • y−γ·
  • under P1
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-71
SLIDE 71

Self-similar growth-fragmentation

Y∅ b1 Y1 b2 Y2 b21

self-similar: law of Y under Py = law of yY

  • y−γ·
  • under P1
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-72
SLIDE 72

Self-similar growth-fragmentation

Y∅ b1 Y1 b2 Y2 b21 Y21

self-similar: law of Y under Py = law of yY

  • y−γ·
  • under P1
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-73
SLIDE 73

Self-similar growth-fragmentation

Y∅ b1 Y1 b2 Y2 b21 Y21

Y (t) =

  • Yu(t − bu): bu ≤ t
  • =
  • Y1(t) ≥ Y2(t) ≥ · · ·
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

2/10

slide-74
SLIDE 74

Markov branching process

X (5) :

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

3/10

slide-75
SLIDE 75

Markov branching process

X (5) :

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

3/10

slide-76
SLIDE 76

Markov branching process

X (5) :

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

3/10

slide-77
SLIDE 77

Markov branching process

X (5) :

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

3/10

slide-78
SLIDE 78

Markov branching process

X (5) :

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

3/10

slide-79
SLIDE 79

Markov branching process

X (5) :

p5,3 p3,2 p2,4 p2,5 p4,3

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

3/10

slide-80
SLIDE 80

Markov branching process

X (5) :

p5,3 p3,2 p2,4 p2,5 p4,3

The system is entirely described through the Markov transition kernel pn,k, n ≤ 2k, of the locally largest particle X (n).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

3/10

slide-81
SLIDE 81

Markov branching process

X (5) :

p5,3 p3,2 p2,4 p2,5 p4,3 locally largest

The system is entirely described through the Markov transition kernel pn,k, n ≤ 2k, of the locally largest particle X (n).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

3/10

slide-82
SLIDE 82

Markov branching process

X (5) :

p5,3 p3,2 p2,4 p2,5 p4,3 locally largest 2nd locally largest

The system is entirely described through the Markov transition kernel pn,k, n ≤ 2k, of the locally largest particle X (n).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

3/10

slide-83
SLIDE 83

Scaling limits

Which asymptotic conditions on (pn,k) imply a scaling limit

  • 1. for the Markov branching process X (n)?
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

4/10

slide-84
SLIDE 84

Scaling limits

Which asymptotic conditions on (pn,k) imply a scaling limit

  • 1. for the Markov branching process X (n)?
  • 2. for the associated genealogical tree X (n)?
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

4/10

slide-85
SLIDE 85

Scaling limits

Which asymptotic conditions on (pn,k) imply a scaling limit

  • 1. for the Markov branching process X (n)?
  • 2. for the associated genealogical tree X (n)?

Without growth: Haas and Miermont (2004, 2012) [self-similar fragmentation tree/process].

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

4/10

slide-86
SLIDE 86

Scaling limits

Which asymptotic conditions on (pn,k) imply a scaling limit

  • 1. for the Markov branching process X (n)?
  • 2. for the associated genealogical tree X (n)?

Without growth: Haas and Miermont (2004, 2012) [self-similar fragmentation tree/process]. Starting point: scaling limit for the locally largest particle X (n).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

4/10

slide-87
SLIDE 87

Two difficulties induced by growth

◮ The total mass is no longer conserved.

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

5/10

slide-88
SLIDE 88

Two difficulties induced by growth

◮ The total mass is no longer conserved. ◮ The system may even explode, e.g.

1 2 1 1 2 1 1 2 1 1

...

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

5/10

slide-89
SLIDE 89

Two difficulties induced by growth

◮ The total mass is no longer conserved. ◮ The system may even explode, e.g.

1 2 1 1 2 1 1 2 1 1

... Since we do not (want to) deal with the behaviour of pn,k for “small” n, we must prune the system:

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

5/10

slide-90
SLIDE 90

Two difficulties induced by growth

◮ The total mass is no longer conserved. ◮ The system may even explode, e.g.

1 2 1 1 2 1 1 2 1 1

... Since we do not (want to) deal with the behaviour of pn,k for “small” n, we must prune the system: Particles with size ≤ M (large but fixed) are frozen. = ⇒ Locally largest particle stopped below M (pn,n := 1, n ≤ M).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Introduction

5/10

slide-91
SLIDE 91

Outline

Introduction

1 Motivating example 2 Self-similar growth-fragmentation 3 Markov branching process 4 Scaling limits 5 Two difficulties induced by growth

Results

6 Assumptions 7 Scaling limit for the process 8 Scaling limit for the tree 9-10 Proof aspects

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results
slide-92
SLIDE 92

Assumptions

Let γ > 0 and (an) regularly varying: ∀x > 0, lim

n→∞ a⌊nx⌋/an = xγ.

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

6/10

slide-93
SLIDE 93

Assumptions

Let γ > 0 and (an) regularly varying: ∀x > 0, lim

n→∞ a⌊nx⌋/an = xγ.

We suppose that there exist q∗ > 0 and a Lévy process ξ such that

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

6/10

slide-94
SLIDE 94

Assumptions

Let γ > 0 and (an) regularly varying: ∀x > 0, lim

n→∞ a⌊nx⌋/an = xγ.

We suppose that there exist q∗ > 0 and a Lévy process ξ such that (H1) for all t ∈ R, Ψn(it) := an

  • m=1

pn,m m n

  • it

− 1

− − →

n→∞

log E[eitξ1] =: Ψ(it);

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

6/10

slide-95
SLIDE 95

Assumptions

Let γ > 0 and (an) regularly varying: ∀x > 0, lim

n→∞ a⌊nx⌋/an = xγ.

We suppose that there exist q∗ > 0 and a Lévy process ξ such that (H1) for all t ∈ R, Ψn(it) := an

  • m=1

pn,m m n

  • it

− 1

− − →

n→∞

log E[eitξ1] =: Ψ(it); (H2) lim sup

n→∞

an

  • m=2n

pn,m m n

  • q∗

< ∞;

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

6/10

slide-96
SLIDE 96

Assumptions

Let γ > 0 and (an) regularly varying: ∀x > 0, lim

n→∞ a⌊nx⌋/an = xγ.

We suppose that there exist q∗ > 0 and a Lévy process ξ such that (H1) for all t ∈ R, Ψn(it) := an

  • m=1

pn,m m n

  • it

− 1

− − →

n→∞

log E[eitξ1] =: Ψ(it); (H2) lim sup

n→∞

an

  • m=2n

pn,m m n

  • q∗

< ∞; (H3) κ(q∗) < 0, and for some ε > 0, lim

n→∞ an n−1

  • m=1

pn,m

  • 1 − m

n

  • q∗−ε

=

  • R−
  • 1 − eyq∗−ε Λ(dy),

with Λ Lévy measure of ξ, κ(q) := Ψ(q) +

  • R−(1 − ey)q Λ(dy).
  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

6/10

slide-97
SLIDE 97

Scaling limit for the process

Theorem 1. Under (H1)–(H3), we can fix M large so that

  • X (n)(⌊ant⌋)

n : t ≥ 0

  • (d)

− − − →

n→∞

Y holds as càdlàg processes in ℓq for q ≥ 1 ∨ q∗.

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

7/10

slide-98
SLIDE 98

Scaling limit for the process

Theorem 1. Under (H1)–(H3), we can fix M large so that

  • X (n)(⌊ant⌋)

n : t ≥ 0

  • (d)

− − − →

n→∞

Y holds as càdlàg processes in ℓq for q ≥ 1 ∨ q∗. The limit Y is the self-similar growth-fragmentation driven by Y , where log Y (t) = ξ t Y (s)−γ ds

  • ,

t ≥ 0.

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

7/10

slide-99
SLIDE 99

Scaling limit for the tree

Theorem 2. Under (H1)–(H3), q∗ > γ, we can fix M so that

X (n) an

(d)

− − − →

n→∞ Y,

as compact real trees in the Gromov–Hausdorff topology.

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

8/10

slide-100
SLIDE 100

Scaling limit for the tree

Theorem 2. Under (H1)–(H3), q∗ > γ, we can fix M so that

X (n) an

(d)

− − − →

n→∞ Y,

as compact real trees in the Gromov–Hausdorff topology. The limit Y is the continuum random tree associated with Y , as constructed by Rembardt and Winkel (2016).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

8/10

slide-101
SLIDE 101

Proof aspects

Convergence of “finite-dimensional marginals”

◮ (H1)-(H2) provide the scaling limit for X (n) and its absorption

time, thanks to a criterion of Bertoin and Kortchemski (2016).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

9/10

slide-102
SLIDE 102

Proof aspects

Convergence of “finite-dimensional marginals”

◮ (H1)-(H2) provide the scaling limit for X (n) and its absorption

time, thanks to a criterion of Bertoin and Kortchemski (2016).

◮ (H3) adds the convergence of the daughter sizes at birth.

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

9/10

slide-103
SLIDE 103

Proof aspects

Convergence of “finite-dimensional marginals”

◮ (H1)-(H2) provide the scaling limit for X (n) and its absorption

time, thanks to a criterion of Bertoin and Kortchemski (2016).

◮ (H3) adds the convergence of the daughter sizes at birth. ◮ Convergence of finite subfamilies of X (n) and subtrees of X (n)

(by induction).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

9/10

slide-104
SLIDE 104

Proof aspects

Tightness

◮ Let κn(q) := Ψn(q) + n−1

  • m=1

pn,m

  • 1 − m

n

  • q

. (H1)–(H3) yield κn(q) → κ(q) for q < q∗ close to q∗.

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

10/10

slide-105
SLIDE 105

Proof aspects

Tightness

◮ Let κn(q) := Ψn(q) + n−1

  • m=1

pn,m

  • 1 − m

n

  • q

. (H1)–(H3) yield κn(q) → κ(q) for q < q∗ close to q∗.

◮ Since κ(q∗) < 0 by (H3), we have a supermartingale

  • i

X (n)

i

(k)q, k ≥ 0, for q close enough to q∗ and M such that κn(q) ≤ 0, n > M.

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

10/10

slide-106
SLIDE 106

Proof aspects

Tightness

◮ Let κn(q) := Ψn(q) + n−1

  • m=1

pn,m

  • 1 − m

n

  • q

. (H1)–(H3) yield κn(q) → κ(q) for q < q∗ close to q∗.

◮ Since κ(q∗) < 0 by (H3), we have a supermartingale

  • i

X (n)

i

(k)q, k ≥ 0, for q close enough to q∗ and M such that κn(q) ≤ 0, n > M.

◮ Many-to-one formula by size-biasing (−

→ tilted kernel (¯ pn,m)).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

10/10

slide-107
SLIDE 107

Proof aspects

Tightness

◮ Let κn(q) := Ψn(q) + n−1

  • m=1

pn,m

  • 1 − m

n

  • q

. (H1)–(H3) yield κn(q) → κ(q) for q < q∗ close to q∗.

◮ Since κ(q∗) < 0 by (H3), we have a supermartingale

  • i

X (n)

i

(k)q, k ≥ 0, for q close enough to q∗ and M such that κn(q) ≤ 0, n > M.

◮ Many-to-one formula by size-biasing (−

→ tilted kernel (¯ pn,m)).

◮ Convergence of the size-biased particle and its absorption time,

using again the criterion of Bertoin and Kortchemski (for ¯ p).

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

10/10

slide-108
SLIDE 108

Proof aspects

Tightness

◮ Let κn(q) := Ψn(q) + n−1

  • m=1

pn,m

  • 1 − m

n

  • q

. (H1)–(H3) yield κn(q) → κ(q) for q < q∗ close to q∗.

◮ Since κ(q∗) < 0 by (H3), we have a supermartingale

  • i

X (n)

i

(k)q, k ≥ 0, for q close enough to q∗ and M such that κn(q) ≤ 0, n > M.

◮ Many-to-one formula by size-biasing (−

→ tilted kernel (¯ pn,m)).

◮ Convergence of the size-biased particle and its absorption time,

using again the criterion of Bertoin and Kortchemski (for ¯ p).

◮ Uniform control of height(X (n)) by Foster–Lyapunov means.

  • B. Dadoun | Self-similar scaling limits of Markov branching processes › Results

10/10

slide-109
SLIDE 109

Thank you!