AbstractWe consider branching random walks in d-dimensional integer lattice with time–space i.i.d. offspring distributions. This model is known to exhibit a phase transition: If d≥3 and the environment is “not too random”, then, the total population grows as fast as its expectation with strictly positive probability. If, on the other hand, d≤2, or the environment is “random enough”, then the total population grows strictly slower than its expectation almost surely. We show the equivalence between the slow population growth and a natural localization property in terms of “replica overlap”. We also prove a certain stronger localization property, whenever the total population grows strictly slower than its expectation almost surely
We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, th...
We prove the quenched version of the central limit theorem for the displacement of a random walk in ...
International audienceRandom walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_...
We consider branching random walks in d-dimensional integer lattice with time-space i.i.d. offspring...
AbstractWe consider branching random walks in d-dimensional integer lattice with time–space i.i.d. o...
International audienceRandom walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_...
AbstractWe consider a transient random walk on Z in random environment, and study the almost sure as...
We consider a recurrent random walk in random environment on a regular tree. Under suitable general ...
AbstractWe consider Sinai’s random walk in random environment. We prove that infinitely often (i.o.)...
We consider branching random walks in d-dimensional integer lattice with time-space i.i.d. offspring...
Funder: Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and E...
International audienceRandom walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_...
Motivated by a seminal paper of Kesten et al. (Ann. Probab., 3(1), 1–31, 1975) we consider a branchi...
AbstractCompleting previous results, we construct, for every 12⩽s⩽1, explicit examples of nearest ne...
AbstractLet S0, S1, … be a simple (nearest neighbor) symmetric random walk on Zd and HB(x,y) = P{S. ...
We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, th...
We prove the quenched version of the central limit theorem for the displacement of a random walk in ...
International audienceRandom walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_...
We consider branching random walks in d-dimensional integer lattice with time-space i.i.d. offspring...
AbstractWe consider branching random walks in d-dimensional integer lattice with time–space i.i.d. o...
International audienceRandom walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_...
AbstractWe consider a transient random walk on Z in random environment, and study the almost sure as...
We consider a recurrent random walk in random environment on a regular tree. Under suitable general ...
AbstractWe consider Sinai’s random walk in random environment. We prove that infinitely often (i.o.)...
We consider branching random walks in d-dimensional integer lattice with time-space i.i.d. offspring...
Funder: Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and E...
International audienceRandom walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_...
Motivated by a seminal paper of Kesten et al. (Ann. Probab., 3(1), 1–31, 1975) we consider a branchi...
AbstractCompleting previous results, we construct, for every 12⩽s⩽1, explicit examples of nearest ne...
AbstractLet S0, S1, … be a simple (nearest neighbor) symmetric random walk on Zd and HB(x,y) = P{S. ...
We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, th...
We prove the quenched version of the central limit theorem for the displacement of a random walk in ...
International audienceRandom walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_...