We study weak and strong survival for branching random walks on multigraphs. We prove that, for a large class of multigraphs, weak survival is related to a geometrical parameter of the multigraph and that the existence of a pure weak phase is equivalent to nonamenability. Finally we study weak and strong critical behaviors of the branching random walk.
We study the asymptotic behavior of the probability of non extinction of a weakly subcritical multitype branching process in iid random environments. Under suitable assumptions, the survival probability is of order of $ρ^n n ^{-3/2}$ for some $ρ\in (0, 1)$ to specify.
In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching random walk on such trees, which is the discrete version of Ramola, Majumdar and Schehr 2015, generalized to arbitrary offspring and displacement distributions with moment constraints.
It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time heavy-tailed branching random walks on a multidimensional lattice. We will be mainly interested in studying the problems related to the limiting behavior of branching random walks such as the existence of phase transitions under change of various parameters, the properties of the limiting distribution and the survival probability of a particle population. Emph…
We study the asymptotic behaviour of the survival probability of a multi-type branching processes in random environment. The class of processes we consider corresponds, in the one-dimensional situation, to the intermediately subcritical case. We show under rather general assumptions on the form of the offspring generating functions of particles that the probability of survival up to generation $n$ of the process initiated at moment zero by a single particle of any type is of order $λ^{n}n^{-1/2}$ for large $n,$ where $λ\in (0,1)$ is a constant specified by the Lyapunov exponent of the mean mat…
We consider a branching random walk with an absorbing barrier, where the step of the associated one-dimensional random walk is in the domain of attraction of an $α$-stable law with $1<α<2$. We shall prove that there is a barrier $an^{\frac{1}{1+α}}$ and a critical value $a_α$ such that if $a<a_α$, then the process dies; if $a>a_α$, then the process survives. The results generalize previous results in literature for the case $α=2$.
We consider a critical branching process in an i.i.d. random environment, in which one immigrant arrives at each generation. We are interested in the event $\mathcal{A}_i(n)$ that all individuals alive at time $n$ are offspring of the immigrant which joined the population at time $i$. We study the asymptotic probability of this event when $n$ is large and $i$ follows different asymptotics which may be related to $n$ ($i$ fixed, close to $n$, or going to infinity but far from $n$). In order to do so, we establish some conditional limit theorems for random walks, which are of independent interes…
We consider a branching system of random walk in random environment (in location) in $\mathbb{N}$. We will give the exact limit value of $\frac{M_{n}}{n}$, where $M_{n}$ denotes the minimal position of branching random walk at time $n$. A key step in the proof is to transfer our branching random walks in random environment (in location) to branching random walks in random environment (in time), by use of Bramson's "branching processes within a branching process" .
Branching-stable processes have recently appeared as counterparts of stable subordinators, when addition of real variables is replaced by branching mechanism for point processes. Here, we are interested in their domains of attraction and describe explicit conditions for a branching random walk to converge after a proper magnification to a branching-stable process. This contrasts with deep results that have been obtained during the last decade on the asymptotic behavior of branching random walks and which involve either shifting without rescaling, or demagnification.
We consider a subcritical branching process in an i.i.d. random environment, in which one immigrant arrives at each generation. We consider the event $% \mathcal{A}_{i}(n)$ that all individuals alive at time $n$ are offspring of the immigrant which joined the population at time $i$ and investigate the asymptotic probability of this extreme event when $n\to\infty$ and $i$ is either fixed, or the difference $n-i$ is fixed, or $\min(i,n-i)\to\infty.$ To deduce the desired asymptotics we establish some limit theorems for random walks conditioned to be nonnegative or negative.
Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$ and consider a simple symmetric random walk that is killed upon hitting one of the obstacles. For $d \geq 2$ and $p$ strictly above the critical threshold for site percolation, we condition on the environment such that the origin is contained in an infinite connected component free of obstacles. It has previously been shown that with high probability, the random walk conditioned on survival up to time $n$ will be localized in a ball of volume asymptotically $d\log_{1/p}n$. In this work, we prove that this ba…
We study the asymptotic behaviour of the survival probability of a multitype branching process in random environment. The class of processes we consider here corresponds, in the one-dimensional situation, to the strongly subcritical case. We also prove a conditional limit theorem describing the distribution of the number of particles in the process given its survival for a long time.
We study infection spread among biased random walks on $\mathbb{Z}^{d}$. The random walks move independently and an infected particle is placed at the origin at time zero. Infection spreads instantaneously when particles share the same site and there is no recovery. If the initial density of particles is small enough, the infected cloud travels in the direction of the bias of the random walks, implying that the infection does not survive locally. When the density is large, the infection spreads to the whole $\mathbb{Z}^{d}$. The proofs rely on two different techniques. For the small density ca…
We consider a discrete time simple symmetric random walk among Bernoulli obstacles on $\mathbb{Z}^d$, $d\geq 2$, where the walk is killed when it hits an obstacle. It is known that conditioned on survival up to time $N$, the random walk range is asymptotically contained in a ball of radius $\varrho_N=C N^{1/(d+2)}$ for any $d\geq 2$. For $d=2$, it is also known that the range asymptotically contains a ball of radius $(1-ε)\varrho_N$ for any $ε>0$, while the case $d\geq 3$ remains open. We complete the picture by showing that for any $d\geq 2$, the random walk range asymptotically contains a ba…
