• Nenhum resultado encontrado

5.4 Macroscopic approximation

5.4.1 Proof of Theorem 5.1.2

Let (Z(n))n≥1 be a sequence of random measure-valued distributed as Z. In this section, we consider the following scaling: X(n) = 1nZ(n), and we describe the behaviour of this scaled process whenngoes to infinity.

To understand the behaviour of our model in a large population, we can consider that it starts from a deterministic probability measureX0, and approach it by the interesting sequence defined by

X(n)0 = 1 n

n

X

k=0

δYk,

where(Yk)k≥1is a sequence of i.i.d. random variable distributed according toX0. In other words, we

Limit theorems for some branching measure-valued processes

set

Z(n)0 =

n

X

k=0

δYk.

The sequenceX(n) converges. Indeed, by the branching property, we haveZ(n) =d Pnk=0ZYk, where ZYtk are i.i.d., distributed as Z and starting from ZY0k = δYk. Henceforth, if f is a continuous and bounded function then the classical law of large number gives

t≥0, lim

n→∞X(n)t (f) =E

hZYt1(f)ia.s.

So by corollary5.2.4, it implies thatX(n)(pointwise) converges to the solution(µt)t≥0 of the follow- ing integro-differential equation:

µt(f) = µ0(f) +

Z t 0

µs(Gf) (5.7)

+

Z

E

r(x)X

k≥0

pk(x)

Z 1 0

k

X

j=1

f(Fj(k)(x, θ))f(x)µs(dx)ds.

Theorem5.1.2gives a stronger convergence.

Lemma 5.4.1(Semi-martingale decomposition). If Assumption5.2.1, then for all fCc2(E) and t≥0,

X(n)t (f) =X(n)0 (f) +M(n)t (f) +V(n)t (f), where

V(n)t (f) =

Z t 0

Z

E

Gf(x) +r(x)

Z 1 0

X

kN k

X

j=1

f(Fj(k)(x, θ))−f(x)pkX(n)s (dx)ds,

andM(n)t (f)is a square-integrable and càdlàg martingale. Its bracket is defined by hM(n)(f)it= 1

n

Z t 0

2X(n)s (Gf2)−2X(n)s (f×Gf) +

Z

E

r(x)

Z 1 0

X

kN

k

X

j=1

f(Fj(k)(x, θ))−f(x)

2

pk(x) X(n)s (dx)ds.

Proof. It is a direct consequence of Lemma 5.2.3. Indeed, if L(n) is the generator of X(n) then it verifies

L(n)Ff(µ) =tE[Ff(X(n))|X(n)0 =µ] t=0 =tE[Ff /n(Z(n))|Z(n)0 =]t=0 =LFf /n(),

Limit theorems for some branching measure-valued processes

whereFf(µ) =F(µ(f)),F, f are two test functions andLis the generator ofZ.

Remark 5.4.2 (Non explosion). Let us recall that, by Lemma5.2.2, if the assumptions of Theorem 5.1.2hold then Assumption5.2.1holds; that is there is no explosion.

Let us denote byL(U)the law ofU, for any random variableU.

Lemma 5.4.3. Under the assumptions of Theorem5.1.2the sequence(L(X(n)))n≥1is uniformly tight in the space of probability measures onD([0, T],(M(E), dv)).

Proof. We follow the approach of [FM04]. According to [RC86], it is enough to show that, for any continuous bounded functionf, the sequence of laws ofX(n)(f)is tight inD([0, T],R). To prove it, we will use the Aldous-Rebolledo criterion. LetCc be the sef of functions of classC with finite support, we set S = Cc∪ { 1}, where1 is the mapping x 7→ 1. We have to prove that, for any functionfS, we have

1. ∀t≥0,X(n)t (f)

n≥0is tight;

2. for alln ∈N, andε, η > 0, there existsδ >0such that for each stopping timeSnbounded by T,

lim sup

n→+∞

sup

0≤uδP(|V(n)Sn+u(f)−V(n)S

n(f)| ≥η)≤ε.

lim sup

n→+∞

sup

0≤uδP(|hM(n)(f)iSn+u− hM(n)(f)iSn| ≥η)≤ε.

The first point is the tightness of the family of time-marginals(X(n)t (f))n≥1 and the second point, called the Aldous condition, gives a "stochastic continuity". It looks like the Arzelà-Ascoli Theorem.

Using Lemma5.2.2, there existsC >0such that

P(|X(n)t (f)|> k)≤ kfkE[X(n)t (1)]

k

≤ kfkCE[X(n)0 (1)]

k ,

which tends to0asktends to infinity. This proves the first point. Let δ >0, we get for all stopping

Limit theorems for some branching measure-valued processes

timesSnTn≤(Sn+δ)≤T, that there existC0, Cf >0such that E[|V(n)Tn(f)−V(n)Sn(f)|] =E

"

Z Tn

Sn

X(n)s (Gf) +

Z

E

r(x)

Z 1 0

X

kN k

X

j=1

fFj(k)(x, θ)f(x)pk(x)X(n)s (dx)ds

C0[kGfk+kfk]×E[|TnSn|]

Cfδ.

In the other hand, there existsCf0 >0such that E[|hM(n)(f)iTn− hM(n)(f)iSn|]

=1 nE

"

Z Tn

Sn

2X(n)s (Gf2)−2X(n)s (f Gf) +

Z

E

r(x)

Z 1 0

X

kN k

X

j=1

fFj(k)(x, θ)f(x)2pkX(n)s (dx)ds

Cf0δ n.

Then, for a sufficiently smallδ, the second point is verified and we conclude that (X(n))n≥1 is uni- formly tight inD([0, T],(M(E), dv)).

Proof of Theorem5.1.2. Let us denote by Xa limit process of(X(n))n≥1; namely there exists an in- creasing sequence(un)n≥1, onN, such that(X(un))n≥1converges toX. It is almost surely continuous in(M(E), v)since

sup

t≥0

sup

kfk≤1

|X(n)t(f)−X(n)t (f)| ≤ ¯k

n. (5.8)

In the case whereEis compact, the vague and weak topologies coincide. By Doob’s inequality, there existsC >0such that

sup

f E

"

sup

tT

M(n)t (f)

#

≤2 sup

f E

hhM(n)(f)iT

iC n

where the supremum is taken over all the functionfCc2(E)such thatkfk≤1. Hence,

n→+∞lim sup

f E

"

sup

tT

M(n)t (f)

#

= 0. (5.9)

Limit theorems for some branching measure-valued processes

But as

M(n)t (f) = X(n)t (f)−X(n)0 (f)

Z t 0

Z

E

Gf(x) +r(x)

Z 1 0

X

kN k

X

j=1

fFj(k)(x, θ)f(x)pk(x)X(n)s (dx)ds,

we have

0 =Xt(f)−X0(f)−

Z t 0

Xs(Gf) +

Z

E

r(x)

k

X

j=1

f(Fj(K)(x, θ))pk(x)f(x)

Xs(dx)ds.

Since this equation has a unique solution, it ends the proof whenE is compact. This approach fails in the non-compact case. Nevertheless, we can use the Méléard-Roelly criterion [MR93]. We have to prove thatXis inC([0, T],(M(E), w))andX(n)(1)converges toX(1). By (5.8), Xis continuous.

To prove thatX(n)(1)converges toX(1), we use the following lemmas.

Lemma 5.4.4(Approximation of indicator functions). For eachk ∈N, there existsψkC2(E)such that:

xE, 1[k;+∞[(x)≤ψk(x)≤1[k−1;+∞[(x)and∃C, Gψkk−1. Proof. See [JMW12, lemma 4.2] or [MT12, lemma 3.3].

Lemma 5.4.5(Commutation of limits). Under the assumptions of Theorem5.1.2,

k→+∞lim lim sup

n→+∞ E

"

sup

tT

X(n)t (ψk)

#

= 0, where(ψk)k≥0 are defined as in the previous lemma.

The proof is postponed after. Hence, a same computation to [MT12] gives us the convergence in D([0, T],(M(E), w)). Thus, each subsequence converges to the equation (5.7). The end of the proof follow with the same argument of the compact case.

We can give another argument, which does not use the Méléard-Roelly criterion [MR93]. As sup

t≥0

sup

kfk≤1

|X(n)t(f)−X(n)t (f)| ≤ ¯k n,

Xis continuous from[0, T]to(M(E), dw). LetGbe a Lipschitz function onC([0, T],(M(E), dw)),

Limit theorems for some branching measure-valued processes

we get,

|E[G(X(un))]−G(X)| ≤E

"

sup

t∈[0,T]

dwX(ut n),Xt

#

≤E

"

sup

t∈[0,T]

dwX(ut n),X(ut n)(· ×(1−ψk))

#

+E

"

sup

t∈[0,T]

dwX(ut n)(· ×(1−ψk)),Xt(· ×(1−ψk))

#

+ sup

t∈[0,T]

dw(Xt(· ×(1−ψk)),Xt).

According to Lemma5.4.5, we obtain that

k→+∞lim lim sup

n→+∞ E

"

sup

t∈[0,T]

dwX(ut n),X(ut n)(· ×(1−ψk))

#

= 0 and

k→+∞lim sup

t∈[0,T]

dw(Xt(· ×(1−ψk)),Xt) = 0.

Then, we have

dwX(ut n)(· ×(1−ψk)),Xt(· ×(1−ψk))

=dvX(ut n)(· ×(1−ψk)),Xt(· ×(1−ψk)). Thus,

k→+∞lim lim sup

n→+∞ E

"

sup

t∈[0,T]

dwX(ut n)(· ×(1−ψk)),Xt(· ×(1−ψk))

#

= 0, by continuity ofν 7→ν(1−ψk)inD(M(E), dv). And finally,

n→+∞lim GX(un)=G(X), which completes the proof.

Limit theorems for some branching measure-valued processes

proof of Lemma5.4.5. Ifµn,kt =E(X(n)t (ψk))then we have µn,kt =E[X(n)0 (ψk)] +

Z t 0 E

Z

E

k(x) +r(x)

X

k≥1 k

X

j=1

pk(x)

Z 1 0

ψk(Fj(k)(x, θ))−ψk(x)

X(n)s (dx)

ds

µn,k0 +C

Z t 0

µn,k−1s +µn,ks ds.

Now, by Gronwall’s Lemma, iteration and monotonicity, we deduce that µn,ktC1(µn,k0 +

Z t 0

µn,k−1s ds)

C1µn,k0 +C12T µn,k−10 +

Z t 0

Z s 0

µn,k−2u duds

k−1

X

l=0

µn,kl0 C1(C1T)l

l! +C2× (C1T)k k!

µn,bk/2c0 C1eC1T +C3 X

l>bk/2c

(C1T)l

l! +C2× (C1T)k k! , whereC1, C2 andC3are three constants. Thus,

k→+∞lim lim sup

n→+∞

µn,kt = 0.

And finally the following expression completes the proof, E

"

sup

tT

|Xnt(ψk)|

#

µn,k0 +C

Z t 0

µn,k−1s +µn,ks ds+E

"

sup

tT

|M(n)t (ψk)|

#

.