• Aucun résultat trouvé

Branching random walks in random environment and super-brownian motion in random environment

N/A
N/A
Protected

Academic year: 2022

Partager "Branching random walks in random environment and super-brownian motion in random environment"

Copied!
39
0
0
En savoir plus ( Page)

Texte intégral

(1)

www.imstat.org/aihp 2015, Vol. 51, No. 4, 1251–1289

DOI:10.1214/14-AIHP620

© Association des Publications de l’Institut Henri Poincaré, 2015

Branching random walks in random environment and super-Brownian motion in random environment

Makoto Nakashima

Division of Mathematics, Graduate School of Pure and Applied Sciences,University of Tsukuba, 1-1-1 Ten-noudai, Tsukuba-shi, Ibaraki-ken, Japan. E-mail:nakamako@math.tsukuba.ac.jp

Received 30 June 2013; revised 16 April 2014; accepted 16 April 2014

Abstract. We focus on the existence and characterization of the limit for a certain critical branching random walks in time–space random environment in one dimension which was introduced by Birkner, Geiger and Kersting in (InInteracting Stochastic Systems (2005) 269–291 Springer). Each particle performs simple random walk onZand branching mechanism depends on the time–space site. The limit of this measure-valued processes is characterized as the unique solution to the non-trivial martingale problem and called super-Brownian motion in a random environment by Mytnik in (Ann. Probab.24(1996) 1953–1978).

Résumé. Nous étudions l’existence et la caractérisation de la limite de marches branchantes critiques dans un environnement spatio-temporel aléatoire en dimension 1 introduit par Birkner, Geiger and Kersting dans (InInteracting Stochastic Systems(2005) 269–291 Springer). Chaque particule effectue une marche aléatoire simple surZet le mécanisme de branchement dépend du site indexé par l’espace et le temps. La limite de ce processus à valeur mesure est caractérisée comme l’unique solution d’un problème de martingale non-trivial et correspond au super mouvement Brownien en environnement aléatoire par Mytnik dans (Ann. Probab.

24(1996) 1953–1978).

MSC:60H15; 60J68; 60J80; 60K37

Keywords:Superprocesses in a random environment; Branching random walks in a random environment; Stochastic heat equations; Uniqueness

We denote by(Ω,F, P )a probability space. LetN= {0,1,2, . . .},N= {1,2,3, . . .}, andZ= {0,±1,±2, . . .}. Let Cx1,...,xporC(x1, . . . , xp)be a non-random constant which depends only on the parametersx1, . . . , xp.

1. Introduction

Super-Brownian motion (SBM) is a measure-valued process which was introduced by Dawson and Watanabe inde- pendently [4,30] and is obtained as the limit of (asymptotically) critical branching Brownian motions (or branching random walks). There are many books for introduction of super-Brownian motion [6,10] and dealing with several aspects of it [8,9,15,25]. Also, super-Brownian motion appears in physics and population genetics.

An example of the construction is the following, where we always treat Euclidean space as the space,Rd in this paper. We assume that at time 0, there are N particles in Zd as the 0th generation particle. Each of N particles chooses independently of each other a nearest neighbor site uniformly, moves there at time 1, and then each particle independently of each other either dies or splits into two particles with probability 1/2 (1st generation). The newly produced particles in thenth generation perform in the same manner, that is each of them chooses independently of each other a nearest neighbor site uniformly, moves there at timen+1, and then each particle independently of each other either dies or splits into 2 particles with probability 1/2.

(2)

LetX(N )t (·)be the measure-valued Markov processes defined by X(N )t (B)={particles inB

N att Nth generation at timet N}

N ,

whereBB(Rd)are Borel sets inRd andB

N= {x=y

N foryB}. Then, under some conditions, they con- verge asN→ ∞to a measure-valued processes,super-Brownian motion. In particular, the limit,Xt, is characterized as the unique solution to the martingale problem:

⎧⎪

⎪⎨

⎪⎪

For allφCb2(R),

Zt(φ):=Xt(φ)X0(φ)t

0 1

2dXs(φ)ds is anFtX-continuous square-integrable martingale Z0(φ)=0 and Z(φ)t=t

0Xs2)ds,

(1.1)

whereν(φ)=

φdνfor any measureν.

It is a well-known fact that one-dimensional super-Brownian motion is related to a stochastic heat equation [14, 26]. Whend=1, super-Brownian motionXt(dx)is almost surely absolutely continuous with respect to the Lebesgue measure and its densityu(t, x)satisfies the following stochastic heat equation:

∂tu=1

2u+√

uW (t, x),˙

whereW (t, x)˙ is time–space white noise. On the other hand, ford≥2,Xt(·)is almost surely singular with respect to the Lebesgue measure [7,16,23,24].

In this paper, we consider super-Brownian motion in a random environment, which was introduced in [19]. Mytnik showed the existence and uniqueness of the scaling limitXt(·)for a certain critical branching diffusion in a random environment with some conditions. It is characterized as the unique solution to the martingale problem:

⎧⎪

⎪⎪

⎪⎪

⎪⎩

For allφCb2(Rd),

Zt(φ):=Xt(φ)X0(φ)t

0 1

2Xs(φ)ds

is anFtX-continuous square-integrable martingale and Z(φ)t=t

0Xs2)ds+t 0

Rd×Rdg(x, y)φ(x)φ(y)Xs(dx)Xs(dy)ds,

(1.2)

whereg(·,·)is bounded continuous function in a certain class. In this paper, we construct a super-Brownian motion in a random environment as the limit of scaled branching random walks in a random environment, which is a solution to (1.2) for the case whereg(x, y)is replaced byδx,yandd=1. The definition of such a martingale problem is formal.

The rigorous definition will be given later.

2. Branching random walks in a random environment

Before giving the system of the branching random walks in a random environment, we introduce the Ulam–Harris tree T for labeling the particles. We setTk=(N)k+1fork≥1. Then, the Ulam–Harris treeT is defined byT =

k0Tk. We will give a name to each particle by using elements ofT.

(i) When there areMparticles at the 0th generation, we label them as 1,2, . . . , M∈T0.

(ii) If the nth generation particle x=(x0, . . . , xn)Tn gives birth to kx particles, then we name them as (x0, . . . , xn,1), . . . , (x0, . . . , xn, kx)Tn+1.

Thus, every particle in the branching systems has its own name inT. We define|x|by its generation, that is ifxis an element ofTk, then|x| =k. For convenience, we denote by|x∧y|the generation of the closest common ancestor of xandy. Ifxandy have no common ancestor, then we define|x∧y| = −∞. Also, we denote byy/xthe last digit ofy whenyis a child ofx, that is

y/x=

ky, ifx=(x0, . . . , xn)Tn,y=(x0, . . . , xn, ky)Tn+1, for somen∈N,

, otherwise.

(3)

Now, we give the definition of branching random walks in a random environment. In our case, a particle moves on Zand the process evolves by the following rules:

(i) The initial particles are located at sites{xi∈2Z: i=1, . . . , MN}.

(ii) Each particle located at sitexat timenchooses a nearest neighbor site independently of each others with proba- bility12 and moves there at timen+1. Then, it is replaced byk-children with probabilityqn,x(N )(k)independently of each others,

where{{qn,x(N )(k)}k=0: (n, x)∈N×Z}are the offspring distributions assigned to each time–space site(n, x)which are i.i.d. in(n, x). We denote byBn(N )and byBn,x(N )the total number of particles at timenand the local number of particles at sitexat timen. Also, we denote bym(N,p)n,x thepth moment of offsprings for offspring distribution{qn,x(N )(k)}, that is

m(N,p)n,x =

k=0

kpqn,x(N )(k).

This model is called branching random walks in a random environment (BRWRE) whose properties as measure- valued processes are studied well for “supercritical” case [12,13]. Also, the continuous counterpart, branching Brow- nian motions in a random environment was introduced by Shiozawa [28,29]. We know that the normalized random measure weakly converges to Gaussian measure in probability in one phase, whereas the localization has occurred in the other phase.

In this paper, we focus on the scaled measure-valued processesXt(N )associated to this branching random walks:

X(N )0 = 1 N

MN i=0

δx

i/N1/2, and

X(N )t = 1 N

BtN(N )

i=1

δxi(t )/N1/2, fort= 1

N, . . . ,KN

N for eachK >0,

wherexi(t)is the position of theith particle att Nth generation. We remark that if we identifyBtN,x(N ) as the measure BtN,x(N )δx, thenXt(N )is represented as

X(N )t = 1 Nx∈Z

BtN,x(N )δx/N1/2 fort= 1

N, . . . ,KN N .

LetMF(R)be the set of the finite measures onRwith the topology of weak convergence. For convenience, we extend this model to the càdlàg paths inMF(R)by

X(N )t = 1 Nx∈Z

Bt N,x(N )δx/N1/2, fortt < t+ 1 N,

where we definet fort andN by some positive number Ni fori∈Nsatisfying Nit < i+N1. Then,Xt(N )MF(R) for each t∈ [0, K]. LetφBb(R), where Bb(R)is the set of the bounded Borel measurable functions onR. We denote the product ofνMF(R)andφBb(R)byν(φ), that is

ν(φ)=

Rφ(x)ν(dx).

To describe the main theorem, we introduce the following assumption on the environment:

(4)

Assumption A.

E m(N,1)0,0

=E

k=0

kqn,x(N )(k)

=1, lim

N→∞E

m(N,2)0,0 −1

=γ >0,

sup

N1

E m(N,4)0,0

<, lim

N→∞N1/2E

m(N,1)0,0 −12

=β2,

sup

N1

N1/2E

m(N,1)0,0 −14

<.

Example. The simplest example satisfying AssumptionAis the case where qn,x(N )(0)=12βξ(n,x)2N1/4 , qn,x(N )(2)=12 +

βξ(n,x)

2N1/4 for i.i.d.random variables{ξ(n, x): (n, x)∈N×Z}such thatP (ξ(n, x)=1)=P (ξ(n, x)= −1)=12. Theorem 2.1. We suppose thatX(N )0 (·)X0(·)inMF(R)and AssumptionA.Then,the sequence of measure-valued processes{X(N )· : N∈N}converges to a continuous measure-valued processX·C([0,∞),MF(R)).Moreover,for anyt >0,Xt(dx)is almost surely absolutely continuous with respect to the Lebesgue measure and its densityu(t, x) is the unique nonnegative solution to the following martingale problem:

⎧⎪

⎪⎨

⎪⎪

For allφCb2(R), Zt(φ)=

Rφ(x)u(t, x)dx−

Rφ(x)X0(dx)12t

0

Rφ(x)u(s, x)dxds is anFtX-continuous square-integrable martingale and

Z(φ)t=t

0

Rφ2(x)(γ u(s, x)+2β2u(s, x)2)dxds.

(2.1)

Remark 1. We found in theExampleafter AssumptionAthat the fluctuation of the environment is mainly given by (m(N,1)n,x −1)and scaling factor isN1/4. (It appears clearly in theExampleafter AssumptionA.)This scaling factor is different from N1/2,the one in [19]. When the scaling factor isN1/2,the limit is the usual super-Brownian motion(1.1).

We roughly discuss how the scaling factor in our model is determined.For simplicity,we consider the model for the case where the environment is the one given in theExample.

We scale the space byN1/2.Then,the summation of the fluctuation of the first moment of offsprings in the segment {k} × [x, y]is

z∈[xN1/2,yN1/2]βξ(k,z)

N1/4 .Since it is the summation of i.i.d.random variables of (yx)N2 1/2,the central limit theorem holds and it weakly converges to a Gaussian random variable with distributionN (0,β2(y2x)).Similar argument holds for random variables other than Bernoulli random variables.

Remark 2. The martingale problem(2.1)is the rigorous definition of the martingale problem wheng(x, y) is re- placed byδxyin(1.2).Also,the theorem implies the existence and the uniqueness of the nonnegative solution to the stochastic heat equation

∂tu=1

2u+

γ u+2β2u2W ,˙ (2.2)

andlimt→+0u(t, x)dx=X0(dx)inMF(R),whereW˙ is time–space white noise.In[18],the existence of solutions was proved for general SPDE containing(2.2)when the initial measureX0(dx)has a continuous density with rapidly decreasing at infinity.

Also,there are a lot of papers on uniqueness of the stochastic heat equation∂tu=12u+ |u|αW˙.It is known that weak uniqueness for nonnegative solutions holds for 12α≤1 [20]and pathwise uniqueness holds for 34< α≤1 [21].However,uniqueness in law and pathwise uniqueness fails when solutions are allowed to take negative values forα <34[17].

(5)

3. Proof of Theorem2.1

In this section, we will give a proof of Theorem2.1. The proof is divided into three steps:

(i) tightness,

(ii) identification of the limit point processes, (iii) weak uniqueness of the limit points.

In this section, we consider the following setting for simplicity.

Assumption B. The number of initial particles isN and all of them locates at the origin at time0.Also,qn,x(N )(0)=

1

2βξ(n,x)2N1/4 , qn,x(N )(2)=12+βξ(n,x)2N1/4 for i.i.d.random variables{ξ(n, x): (n, x)∈N×Z}such thatP (ξ(n, x)=1)= P (ξ(n, x)= −1)=12.

To consider the general model, it is almost enough to replace βξ(n,x)N1/4 bym(N,1)n,x −1. We sometimes need to consider {{qn,x(N )(k)}k0: (n, x)∈N×Z}. Especially,γ appears in the same situation as the construction of the usual super- Brownian motion, so the reader will not have any difficulties extending the proof to the more general case.

Before starting the proof, we will look at theXt(N )(φ). SinceX(N )t are constant int∈ [t , t+N1), it is enough to see the difference betweenXt(N )andXt(N )+1/N;

X(N )t+1/N(φ)Xt(N )(φ)= 1 N xt

φ

Yt Nx+1 N1/2

Vxφ

Yt Nx N1/2

,

wherex∼tmeans that the particlexis thetNth generation,Yt Nx is the position of the particlexat timetNforx∼t, Vxis the number of children ofxand for simplicity, we omitN. We defineYt Nx+1=Yt Ny +1fory which is a child ofx.

Also, we divide this summation into four parts:

(LHS)

= 1 Nx∼

t

φ Yt Nx+1

N1/2

Vx−1−βξ(t N, Yt Nx) N1/4

+ 1 N x∼

t

φ Yt Nx+1

N1/2

βξ(t N, Yt Nx) N1/4 + 1

N x

t

φ

Yt Nx+1 N1/2

φ Yt Nx

N1/2

φ

Yt Nx +1 N1/2

+φ

Yt Nx −1 N1/2

−2φ Yt Nx

N1/2 2

+ 1 N x

t

φ

Yt Nx +1 N1/2

+φ

Yt Nx −1 N1/2

−2φ Yt Nx

N1/2 2

=Mt(b,N )(φ)+Mt(e,N )(φ)+Mt(s,N )(φ) + 1

N x

t

φ

Yt Nx +1 N1/2

+φ

Yt Nx −1 N1/2

−2φ Yt Nx

N1/2 2.

Thus, we have that X(N )t (φ)X0(N )(φ)=

Mt(b,N )(φ)+Mt(e,N )(φ)+Mt(s,N )(φ) +

t

0

Xs(N ) ANφ

ds, (3.1)

(6)

where

Mt(b,N )(φ)= 1

N s<tx∼s

φ YsNx+1

N1/2

Vx−1−βξ(sN, YsNx ) N1/4

,

Mt(e,N )(φ)= 1

N s<tx∼s

φ YsNx+1

N1/2

βξ(sN, YsNx) N1/4 ,

Mt(s,N )(φ)= 1

N s<txs

φ

YsNx+1 N1/2

φ YsNx

N1/2

φ

YsNx +1 N1/2

+φ

YsNx −1 N1/2

−2φ YsNx

N12 2

,

andAN:Bb(R)Bb(R)is the following operator;

ANφ(x)=

φ

x+ 1 N1/2

+φ

x− 1

N1/2

−2φ(x) 2

N. Actually, we have that

t

0

X(N )s ANφ

ds=

s<txs

1 NANφ

YsNx N1/2

.

Also, we remark thatMt(b,N )(φ),Mt(e,N )(φ), andMt(s,N )(φ)areFtN(N )-martingales, whereFn(N )is theσ-algebra σ

Vx, Ykx+1, ξ(k, x): |x| ≤n−1, k≤n−1, x∈Z ,

whereF0(N )= {∅, Ω}. Indeed, sinceYnx+1are independent ofVxandξ(n, x), E

Mt(b,N )(φ)Mt(b,N )1/N(φ)|Ft N(N )1

= 1

N x∼t1/N

E

φ Yt Nx

N1/2

Ft N(N )1 E

Vx−1−βξ(t N−1, Yt Nx1) N1/4

FtN(N )1

=0, E

Mt(e,N )(φ)Mt(e,N )1/N(φ)|Ft N(N )1

= 1

N xt1/N

E

φ Yt Nx

N1/2

Ft N(N )1

E

βξ(t N−1, Yt Nx1) N1/4

FtN(N )1

=0, and

E

Mt(s,N )(φ)Mt(s,N )1/N(φ)|Ft N(N )1

=0, almost surely.

Moreover, the decomposition (3.1) is very useful since the martingalesMt(i,N )(φ)(i=b, e, s) are orthogonal to each others. Indeed, we have that

E

Mt(b,N )(φ)

Mt(e,N )(φ)

|Ft N(N )1

= 1 N2

x,xt1/N

E

φ

Yt Nx N1/2

φ

Yt Nx N1/2

FtN(N )1

(7)

×E

E

Vx−1−βξ(t N−1, YtNx1) N1/4

Gt N(N )1βξ(t N−1, Yt Nx1) N1/4

Ft N(N )1

=0,

where Gn(N ) = Fn(N )σ (ξ(n, x): x ∈ Z) almost surely. Also, we can obtain by similar arguments that E[(Mt(b,N )(φ))(Mt(s,N )(φ))|Ft N(N )1] =E[(Mt(s,N )(φ))(Mt(e,N )(φ))|Ft N(N )1] =0 almost surely.

3.1. Tightness

In this subsection, we will prove the following lemma.

Lemma 3.1. The sequence{X(N )}is tight inD([0,∞),MF(R)),and each limit process is continuous.

To prove it, we will use the following theorem which reduces the problem to the tightness of real-valued process [25], Theorem II.4.1.

Theorem 3.2. Assume thatEis a Polish space.LetD0be a separating class ofCb(E)containing1.A sequence of càdlàgMF(E)-valued processes{X(N ): N∈N}isC-relatively compact inD([0,∞),MF(E))if and only if

(i) for everyε, T >0,there is a compact setKT ,εinEsuch that sup

N

P

sup

tT

Xt(N ) KT ,εc

> ε

< ε,

(ii) and for allφD0,{X(N )(φ): N∈N}isC-relatively compact inD([0,∞),R).

Assumption. We chooseCb2(R)as D0,whereC2b(R)is the set of bounded continuous function onRwith bounded derivatives of order1and2.

Hereafter, we will check the conditions (i) and (ii) of Theorem3.2for our case. In the beginning, we give the proof of (ii) by using the following lemmas:

Lemma 3.3. ForφCb2(R), suptK|Mt(s,N )(φ)|→L2 0asN→ ∞for allK >0.

Lemma 3.4 (See [25], Lemma II 4.5). Let(Mt(N ),FNt )be discrete time martingales withM0(N )=0.Let M(N )t=

0s<tE[(Ms(N )+1/NMs(N ))2|FNs ],and we extendM·(N )and M(N )·to[0,∞)as right continuous step functions.

If{ M(N )·: N∈N}isC-relatively compact inD([0,∞),R)and sup

0tK

Mt(N )+1/NMt(N )P 0 asN→ ∞for allK >0, (3.2)

thenM·(N )isC-relatively compact inD([0,∞),R).

If,in addition, Mt(N )2

+ M(N )

t: N∈N

is uniformly integrable for allt,

then M·(Nk)w M· in D([0,∞),R) implies that M is a continuous L2-martingale and (M·(Nk), M(Nk)·)w (M·, M·)inD([0,∞),R)2.

Lemma 3.5. For anyφCb2(R),the sequenceCt(N )(φ)t

0X(N )s (ANφ)dsisC-relatively compact inD([0,∞),R).

(8)

When we can verify the conditions of Lemma3.4forM·(b,N )(φ), andM·(e,N )(φ), the sequence{X(N )· (φ): N∈N}

isC-relatively compact inD([0,∞),R). Moreover, if we check the condition of (i) in Theorem3.2, then the tightness of{X·(N ): N∈N}follows immediately.

Before starting the proof of the above lemmas, we prepare the following lemma. It tells us the mean of the measure Xt(N )is the same as the distribution of the scaled simple random walk.

Lemma 3.6. We define historical process by

Ht(N )= 1 Nx∼

t

δYx

(·∧t)N/N1/2MF

D

[0,∞),R ,

whereYsx=Ysy for0≤s <|x∧y| +1,that isYsxis the position of thesN-generation’s ancestor ofx.

Ifψ:D([0,∞),R)→R0is Borel,then for anyt≥0 E

Ht(N )(ψ )

=EY

ψ

Y(·∧t )N N1/2

, (3.3)

whereY·is the trajectory of simple random walk onZ.In particular,for allφB+(R), E

Xt(N )(φ)

=EY

φ Yt N

N1/2

. (3.4)

Moreover,for allx,K >0,we have that P

sup

tK

X(N )t (1)x

x1. (3.5)

To prove this lemma, we introduce some notation. Forx(·), y(·)D([0,∞),R)such thaty(0)=0, (x/s/y)(t )=

x(t) if 0≤t < s, x(s)+y(ts) ifts.

Then,(x/s/y)(·)D([0,∞),R).

Proof. (3.3) follows from the Markov property. Indeed, we have E

Ht(N )(ψ )

=E 1

N y

t

ψ

Y(y·∧t )N N1/2

=E 1

Nxt1/N

ψ

Y(x·∧t )N N1/2

E

Vx|Ft N(N )1

=E

EZ1 1

N xt1/N

ψ

(Y(x·∧(t1/N ))N/tN/Z1)((· ∧t )N ) N1/2

,

whereZ1(·)is a random function independent ofY·xN such thatZ1(s)=0 for 0≤s <1,P (Z1(s)=1 fors≥1)= P (Z1(s)= −1 for ≥1)=12. Iterating this,

E

Ht(N )(ψ )

=E

EZ1,Z2

1

N xt2/N

ψ

((Y(x·∧t2/N )N/t N−2/Z2)/t N−1/Z1)((· ∧t )N ) N1/2

=EY

ψ

Y((·∧t )N )

N1/2

,

(9)

whereZ2is independent copy ofZ1andY (·)is the trajectory of simple random walk. Also, (3.5) follows from the fact thatX(N )t (1)is anFt N(N )-martingale, from theL1inequality for nonnegative submartingales, and from (3.4).

Proof of Lemma3.5. We knowX(N )0 (φ)=φ(0). Also, we have that for anyK >0 Ct(N )(φ)Cs(N )(φ)

t

s

X(N )u

ANφdu

≤ sup

uK

C(φ)X(N )u (1)|ts|, (3.6)

where we have used that the boundedness of ANφ. We can use the Arzela–Ascoli Theorem by (3.5) and (3.6) so that{C·(N )(φ): N∈N}areC-relatively compact sequences inD([0,∞),R). (See Corollary 3.7.3, Remark 3.7.4, and

Theorem 3.10.2 in [11].)

Proof of Lemma3.3. LethN(y)=Ey[(φ( Y1

N1/2)φ( Y0

N1/2))2]. First, we remark that φ

YsNx+1 N1/2

φ YsNx

N1/2

− 1 NANφ

YsNx N1/2

are orthogonal forx=xs. SinceMt(s,N )(φ)is a martingale, we have that E

MK(s,N )(φ)2

=

s<K

E

Ms(s,N )(φ)2

= 1 N2

s<K

E

xs

E

φ YsNx+1

N1/2

φ YsNx

N1/2

− 1 NANφ

YsNx N1/2

2FsN(N )

≤ 2 N s<K

E 1

N x

s

hN

YsNx + 1

N2 ANφ 2

≤2E K

0

Xs(N )(hN)+ ANφ 2N2Xs(N )(1) ds

≤2

EY

K 0

φ

YsN+1 N1/2

φ YsN

N1/2 2

ds

+ K N2sup

N

ANφ 2

X(N )0 (1)

→0,

where we have used Lemma3.6and the fact that supNANφ<∞forφCb2(R)and{X(N )t (1): 0tK}is a

martingale with respect toFtN(N )in the last line.

Next, we will check the conditions in Lemma3.4forM·(b,N )(φ)andM·(e,N )(φ), that is, (1) { M(b,N )(φ)·+ M(e,N )(φ)·: N∈N}isC-relatively compact inD([0,∞),R),

(2) sup0tK|Mt(b,N )+1/N(φ)Mt(b,N )(φ)+Mt(e,N )+1/N(φ)Mt(e,N )(φ)|→P 0 asN→ ∞for allK >0,

(3) {(Mt(b,N )(φ))2+(Mt(e,N )(φ))2+ M(b,N )(φ)t+ M(e,N )(φ)t: N∈N}is uniformly integrable for allt. As we verified thatM(b,N )(φ)andM(e,N )(φ)are orthogonal, we have that

M(b,N )(φ)+M(e,N )(φ)

·=

M(b,N )(φ)

·+

M(e,N )(φ)

·.

(10)

Moreover, since under fixed environment{ξ(n, x): (n, x)∈N×Z},Vx andVy are independent for x=y, we have that

M(b,N )(φ)

t

=

s<t

E

Ms(b,N )+1/N(φ)Ms(b,N )(φ)2

|FsN(N )

= 1 N2

s<txs

E

φ YsNx+1

N1/2

2FsN(N )

E

Vx−1−βξ(sN, YsNx) N1/4

2FsN(N )

= 1 N2

s<tx∼s

E

φ YsNx+1

N1/2

φ YsNx

N1/2

+φ YsNx

N1/2

2FsN(N )

1− β2 N1/2

= 1 N s<t

Xs(N ) φ2

1− β2 N1/2

+ 1

N1/2 O(1)

N s<t

X(N )s (1)

1− β2 N1/2

= t

0

X(N )s

φ2+O(1) N1/2

ds, and

M(e,N )(φ)

t

=

s<t

E

Ms(e,N )+1/N(φ)Ms(e,N )(φ)2

|FsN(N )

= β2 N2

s<tx,x˜t

E

φ YsNx+1

N1/2

φ YsNx˜ +1

N1/2

FsN(N )

1{YsNx =YsNx˜ } N1/2

= β2 N2

s<tx,x∼˜ t

φ

YsNx N1/2

2

+O(1) N1/2

1{YsNx =YsNx˜ } N1/2

= 1 2

s<tx∈Z

φ

x N1/2

2

+O(1) N1/2

(BsN,x(N ) )2 N3/2

=β2 t

0 x∈Z

φ

x N1/2

2

+O(1) N1/2

(BsN,x(N ) )2 N3/2 ds, where|O(1)| ≤Cφfor a constantCφthat depends only onφ.

Therefore, we have that M(b,N )(φ)

t+

M(e,N )(φ)

t

M(b,N )(φ)

s

M(e,N )(φ)

s

Cφ

M(b,N )(1)

t+

M(e,N )(1)

t

M(b,N )(1)

s

M(e,N )(1)

s

=C

X(N )(1)

t

X(N )(1)

s

, (3.7)

where we remark that{Xt(N )(1): 0t}is a martingale with respect toFtN(N )andMt(s,N )(1)=0 for any 0≤t <∞.

We will proveC-relative compactness of (3.7) by showing the following lemma.

Références

Documents relatifs

Das Beispiel ist gut gewählt, handelt es sich dabei doch um eine Stiftung aus dem Hochmittelalter, die – wenn auch in stark gewandelter Form – heute noch fortbesteht und sich

l Lavado del cabello: para hacer la limpieza del cabello y cuero cabelludo se utiliza un champú adecuado según tipo de cabello.. El champú es una solución detergente suave,

L’idéal serait donc de trouver un équilibre entre travaux pratiques méthodiques (qui enseigne des techniques de laboratoire), des situations-problèmes et des cours

Chapter 3 is devoted to establishing limit theorems for products of random matrices which will be used in the following chapters for the study of a branching random walk with

Abbreviations denote the gene products that catalyze a given reaction: AceEF, subunits E1 and E2 of the pyruvate dehydrogenase complex; Lpd, subunit E3 of the pyruvate

Our proof in this case consists in proving first that we may neglect in probability (using a first-moment method) the time spent backtracking into deep valleys; and then that

Our proof in this case consists in proving first that we may neglect in probability (using a first-moment method) the time spent backtracking into these deep valleys; and then that

To this aim, we use the well known correspondence between recurrent random walks in random environment and critical branching processes in random environment with geometric

Transience has been proved by Bolthausen and Zeitouni ([3]) in dimension d ≥ 3 for small isotropic random perturbations of the simple random walk (in fact, there is no

In 1975, Solomon gives, in a seminal work [22], a criterion of transience-recurrence for these walks, and shows that three different regimes can be distinguished: the random walk may

In the theory of branching process, branching processes in random environment (BPRE), as an impor- tant part, was introduced by Smith and Wilkinson [ 10 ] by supposing that

Remembering that the annealed random walk in Dirichlet environment is an oriented edge linearly reinforced random walk where the initial weights on the edges are the parameters of

Annealed and quenched fluctuations of transient random walks in random environment..

Reetta Holmila, Diane Cyr, Danièle Luce, Pirjo Heikkilä, Michael Dictor, Torben Steiniche, Tuula Stjernvall, Jette Bornholdt, Håkan Wallin, Henrik. Wolff,

In Section 4, using coupling, we obtain heat kernel estimates, which is later used in Section 5 to show the uniqueness of the non-zero limiting velocity.. Throughout the paper,

As was the case for Theorem 3.1, the keys to the proof of Theorem 4.1 are the asymptotics of the quenched proba- bilities to be at the origin at time 2n or to stay confined to

– We study in this work a special class of multidimensional random walks in random environment for which we are able to prove in a non-perturbative fashion both a law of large

The following proposition shows that the conditional probability generating function of the generation size at n has a weak limit when the associated random walk is conditioned to

- We express the asymptotic velocity of random walks in random environment satisfying Kalikow’s condition in terms of the.. Lyapounov exponents which have previously been

Then, in the light of the Proofs of Theorems 1.2 and 1.4, for the γ random walks not to meet at the same time until time t, the strategy which has the “cheapest cost” is to keep

Théorème 2 : (Théorème de Kleene) Soient Λ reg l’ensemble des langages réguliers (générés par des grammaires régulières), Λ rat l’ensemble des langages décrits par toutes

In Section 2 we describe the model of Mandelbrot’s martingale in a random environment, and state for this martingale a variante of Theorems 1.1 and 1.2: see Theorems 2.3 and 2.4,

We consider a branching random walk with a random environment in time, in which the offspring distribution of a particle of generation n and the distribution of the displacements of