We study certain phase transitions of branching random walks (BRW) on Cayley graphs of free products. The aim of this paper is to compare the size and structural properties of the trace, i.e., the subgraph that consists of all edges and vertices that were visited by some particle, with those of the original Cayley graph. We investigate the phase when the growth parameter $λ$ is small enough such that the process survives but the trace is not the original graph. A first result is that the box-counting dimension of the boundary of the trace exists, is almost surely constant and equals the Hausdorff dimension which we denote by $Φ(λ)$. The main result states that the function $Φ(λ)$ has only one point of discontinuity which is at $λ_{c}=R$ where $R$ is the radius of convergence of the Green function of the underlying random walk. Furthermore, $Φ(R)$ is bounded by one half the Hausdorff dimension of the boundary of the original Cayley graph and the behaviour of $Φ(R)-Φ(λ)$ as $λ\uparrow R$ is classified.
In the case of free products of infinite groups the end-boundary can be decomposed into words of finite and words of infinite length. We prove the existence of a phase transition such that if $λ\leq \tildeλ_{c}$ the end boundary of the trace consists only of infinite words and if $λ>\tildeλ_{c}$ it also contains finite words. In the last case, the Hausdorff dimension of the set of ends (of the trace and the original graph) induced by finite words is strictly smaller than the one of the ends induced by infinite words.
We continue our study of critical branching random walk and branching capacity. In this paper we introduce branching recurrence and branching transience and prove an analogous version of Wiener's Test.
The lonely branching random walks on ${\mathbb Z}^d$ is an interacting particle system where each particle moves as an independent random walk and undergoes critical binary branching when it is alone. We show that if the symmetrized walk is recurrent, lonely branching random walks die out locally. Furthermore, the same result holds if additional branching is allowed when the walk is not alone.
We extend the theory of discrete capacity to critical branching random walk. We introduce branching capacity for any finite subset of $\Z^d, d\geq5$. Analogous to the regular discrete capacity, branching capacity is closely related to the asymptotics of the probability of visiting a fixed finite set by a critical branching random walk starting from a distant point and the conditional distribution of the hitting point.
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.
For the critical branching random walk in $\mathbb{Z}^{4}$ with branching at the origin only we find the asymptotic behavior of the probability of the event that there are particles at the origin at moment $t\rightarrow \infty $ and prove a Yaglom type conditional limit theorem for the number of individuals at the origin given that there are particles at the origin.
We establish the almost sure validity of the multifractal formalism for R^d-valued branching random walks on the whole relative interior of the natural convex domain of study.
We develop a criterion for transience for a general model of branching Markov chains. In the case of multi-dimensional branching random walk in random environment (BRWRE) this criterion becomes explicit. In particular, we show that \emph{Condition L} of Comets and Popov is necessary and sufficient for transience as conjectured. Furthermore, the criterion applies to two important classes of branching random walks and implies that the critical branching random walk is transient resp. dies out locally.
Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most $m$ particles per site. We investigate the convergence of weak and strong critical parameters of these truncated branching random walks to the analogous parameters of the original branching random walk. As a corollary, we apply our results to the study of the strong critical parameter of a branching random walk restricted to the cluster of a Bernoulli bond percolation.
It is well known that the behaviour of a branching process is completely described by the generating function of the offspring law and its fixed points. Branching random walks are a natural generalization of branching processes: a branching process can be seen as a one-dimensional branching random walk. We define a multidimensional generating function associated to a given branching random walk. The present paper investigates the similarities and the differences of the generating functions, their fixed points and the implications on the underlying stochastic process, between the one-dimensiona…
We consider the branching random walk drifting to $-\infty$ and we investigate large deviations-type estimates for the first passage time. We prove the corresponding law of large numbers and the central limit theorem.
In this paper, we study the critical branching random walk in the critical dimension, $Z^4$. We provide the asymptotics of the probability of visiting a fixed finite subset and the range of the critical branching random walk conditioned on the total number of offsprings. We also prove that conditioned on visiting, the first visiting point converges in distribution.
We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We characterize the weak critical value and relate it to another geometrical parameter. We prove that, at the strong critical value, the process dies out locally almost surely; while, at the weak critical value, global survival and global extinction are both possible.
The reproduction speed of a continuous-time branching random walk is proportional to a positive parameter $λ$. There is a threshold for $λ$, which is called $λ_w$, that separates almost sure global extinction from global survival. Analogously, there exists another threshold $λ_s$ below which any site is visited almost surely a finite number of times (i.e.~local extinction) while above it there is a positive probability of visiting every site infinitely many times. The local critical parameter $λ_s$ is completely understood and can be computed as a function of the reproduction rates. On the oth…
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 give an alternative proof of a result by N. Gantert, Y. Hu and Z. Shi on the asymptotic behavior of the survival probability of the branching random walk killed below a linear boundary, in the special case of deterministic binary branching and bounded random walk steps. Connections with the Brunet-Derrida theory of stochastic fronts are discussed.
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is a Galton-Watson tree then, in certain circumstances, the branching random walks and contact processes will have weak survival phases. We also provide bounds on critical values.
Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $γ-ε$, where $γ$ denotes the asymptotic speed of the right-most position in the branching random walk. Under mild general assumptions upon the distribution of the branching random walk, we prove that when $ε\to 0$, the probability in question decays like $\exp\{- {β+ o(1)\over ε^{1/2}}\}$, where $β$ is a positive constant depending on the distribution of the branching random walk. In the sp…
We give three different criteria for transience of a Branching Markov Chain. These conditions enable us to give a classification of Branching Random Walks in Random Environment (BRWRE) on Cayley Graphs in recurrence and transience. This classification is stated explicitly for BRWRE on $\Z^d.$ Furthermore, we emphasize the interplay between Branching Markov Chains and the spectral radius. We prove properties of the spectral radius of the Random Walk in Random Environment with the help of appropriate Branching Markov Chains.
In this note, we make explicit the law of the renormalized supercritical branching random walk, giving credit to a conjecture formulated in a previous works of the authors for a continuous analog of the branching random walk. Also, in the case of a branching random walk on a homogeneous tree, we express the law of the corresponding limiting renormalized Gibbs measures, confirming, in this discrete model, conjectures formulated by physicists about the Poisson-Dirichlet nature of the jumps in the limit, and precising the conjecture by giving the spatial distribution of these jumps.
In this article, we study branching random walks on graphs modeling division-mutation processes inspired by adaptive immunity. We apply the theory of expander graphs on mutation rules in evolutionary processes and obtain estimates for the cover times of the branching random walks. This analysis reveals an unexpected saturation phenomenon : increasing the mutation rate above a certain threshold does not enhance the speed of state-space exploration.
We consider a supercritical symmetric continuous-time branching random walk on a multidimensional lattice with a finite number of particle generation sources of varying positive intensities without any restrictions on the variance of jumps of the underlying random walk. It is assumed that the spectrum of the evolution operator contains at least one positive eigenvalue. We prove that under these conditions the largest eigenvalue of the evolution operator is simple and determines the rate of exponential growth of particle quantities at every point on the lattice as well as on the lattice as a wh…
We consider the time evolution of a lattice branching random walk with local perturbations. Under certain conditions, we prove the Carleman type estimation for the moments of a particle subpopulation number and show the existence of a steady state.
We consider branching random walk in random environment (BRWRE) and prove the existence of deterministic subsequences along which their maximum, centered at its mean, is tight. This partially answers an open question in arXiv:1711.00852. The method of proof adapts an argument developed by Dekking and Host for branching random walks with bounded increments. The question of tightness without the need for subsequences remains open.
We write $R_n$ for the minimal position attained after time $n$ by a branching random walk in the boundary case. In this article, we prove that $R_n - \frac{1}{2} \log n$ converges in law toward a shifted Gumbel distribution.
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 distribution of the maximal displacement of particles positions for the whole time of the population existence in the model of critical and subcritical catalytic branching random walk on Z. In particular, we prove that in the case of simple symmetric random walk on Z, the distribution of the maximal displacement has "a heavy tail" decreasing as a function of the power 1/2 or 1, when the branching process is critical or subcritical, respectively. These statements describe new effects which do not arise in the corresponding investigations of the maximal displacement of critical and …
Foss and Zachary (2003) and Foss, Palmowski and Zachary (2005) studied the probability of achieving a receding boundary on a time interval of random length by a random walk with a heavy-tailed jump distribution. They have proposed and developed a new approach that allows to generalise results of Asmussen (1998) onto the case of arbitrary stopping times and a wide class of nonlinear boundaries, and to obtain uniform results over all stopping times. In this paper, we consider a class of branching random walks with fading branching and obtain results on the tail asymptotics for the maximum of a b…
In this paper, we study the probability of visiting a distant point $a\in \mathbb{Z}^4$ by critical branching random walk starting from the origin. We prove that this probability is bounded by $1/(|a|^2\log |a|)$ up to a constant.
In a seminal paper Biggins and Kyprianou \cite{BKy04} proved the existence of a non degenerate limit for the {\it Derivative martingale} of the branching random walk. As shown in \cite{Aid11} and \cite{Mad11}, this is an object of central importance in the study of the extremes of the branching random walk. In this paper we investigate the tail distribution of the limit of the {\it Derivative Martingale} by mean of the study of the global minimum of the branching random walk. This new approach leads us to extend the results of \cite{Gui90} and \cite{Bur09} under slighter assumptions.
An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely continuous invariant measure for the "environments viewed from the particle".
We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate last passage decomposition. Secondly, we obtain exponential moment bounds for functionals of the branching random walk, under optimal condition. As a corollary we obtain an approximate variational characterisation of the branching capacity. We finally derive upper bounds involving the branching capacity for the tail of the time spent in an arbitrary finite coll…
We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random walks. We characterise the rate function as the solution of a variational problem. We consider the same random number of independent random walks, and show that the maximum of the branching random walk is dominated by the maximum of the independent random walks. For the maximum of independent random walks, we derive a large deviation principle as well. It turns o…
In this paper, we reveal the branching structure for a non-homogeneous random walk with bounded jumps. The ladder time $T_1,$ the first hitting time of $[1,\infty)$ by the walk starting from $0,$ could be expressed in terms of a non-homogeneous multitype branching process. As an application of the branching structure, we prove a law of large numbers of random walk in random environment with bounded jumps and specify the explicit invariant density for the Markov chain of ``the environment viewed from the particle" .The invariant density and the limit velocity could be expressed explicitly in te…
We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change over time macroscopically. We find the asymptotics of the maximum up to an $O_P(1)$ (stochastically bounded) error, and focus on the following phenomena: the profile of the variance matters, both to the leading (velocity) term and to the logarithmic correction term, and the latter exhibits a phase transition.
We consider the subcritical contact branching random walk on Zd in continuous time with the arbitrary number of offspring and with immigration. We prove the existence of the steady state (statistical equilibrium).
We consider a continuous-time branching random walk in the inhomogeneous breeding potential $β|.|^p$, where $β> 0$, $p \geq 0$. We prove that the population almost surely explodes in finite time if $p > 1$ and doesn't explode if $p \leq 1$. In the non-explosive cases, we determine the asymptotic behaviour of the rightmost particle.
We establish recurrence and transience criteria for critical branching processes in random environment with immigration. These results are then applied to discuss recurrence and transience of a recurrent random walk in a random environment on Z that will be disturbed by cookies inducing a drift to the right of strength 1.
This paper is a collection of recent results on discrete-time and continuous-time branching random walks. Some results are new and others are known. Many aspects of this theory are considered: local, global and strong local survival, the existence of a pure global survival phase and the approximation of branching random walks by means of multitype contact processes or spatially confined branching random walks. Most results are obtained using a generating function approach: the probabilities of extinction are seen as fixed points of an infinite dimensional power series. Throughout this paper we…
By decomposing the random walk path, we construct a multitype branching process with immigration in random environment for corresponding random walk with bounded jumps in random environment. Then we give two applications of the branching structure. Firstly, we specify the explicit invariant density by a method different with the one used in Brémont [3] and reprove the law of large numbers of the random walk by a method known as the environment viewed from particles". Secondly, the branching structure enables us to prove a stable limit law, generalizing the result of Kesten-Kozlov-Spitzer [11] …
In this paper, we study the overlap distribution and Gibbs measure of the Branching Random Walk with Gaussian increments on a binary tree. We first prove that the Branching Random Walk is 1 step Replica Symmetry Breaking and give a precise form for its overlap distribution, verifying a prediction of Derrida and Spohn. We then prove that the Gibbs measure of this system satisfies the Ghirlanda-Guerra identities. As a consequence, the limiting Gibbs measure has Poisson-Dirichlet statistics. The main technical result is a proof that the overlap distribution for the Branching Random Walk is suppor…
Examples of interacting particle systems on $\mathbb{Z}$ as Pfaffian point processes: coalescing branching random walks and annihilating random walks with immigration
Consider a branching random walk on the real line with a killing barrier at zero: starting from a nonnegative point, particles reproduce and move independently, but are killed when they touch the negative half-line. The population of the killed branching random walk dies out almost surely in both critical and subcritical cases, where by subcritical case we mean that the rightmost particle of the branching random walk without killing has a negative speed, and by critical case, when this speed is zero. We investigate the total progeny of the killed branching random walk and give their precise ta…
The behavior of the maximal displacement of a supercritical branching random walk has been a subject of intense studies for a long time. But only recently the case of time-inhomogeneous branching has gained focus. The contribution of this paper is to analyze a time-inhomogeneous model with two levels of randomness. In the first step a sequence of branching laws is sampled independently according to a distribution on the set of point measures' laws. Conditionally on the realization of this sequence (called environment) we define a branching random walk and find the asymptotic behavior of its ma…
We consider a general discrete-time branching random walk on a countable set X. We relate local, strong local and global survival with suitable inequalities involving the first-moment matrix M of the process. In particular we prove that, while the local behavior is characterized by M, the global behavior cannot be completely described in terms of properties involving M alone. Moreover we show that locally surviving branching random walks can be approximated by sequences of spatially confined and stochastically dominated branching random walks which eventually survive locally if the (possibly f…
We consider a branching random walk on the lattice, where the branching rates are given by an i.i.d. Pareto random potential. We describe the process, including a detailed shape theorem, in terms of a system of growing lilypads. As an application we show that the branching random walk is intermittent, in the sense that most particles are concentrated on one very small island with large potential. Moreover, we compare the branching random walk to the parabolic Anderson model and observe that although the two systems show similarities, the mechanisms that control the growth are fundamentally dif…
Considering a critical branching random walk on the real line. In a recent paper, Aidekon [3] developed a powerful method to obtain the convergence in law of its minimum after a log-factor normalization. By an adaptation of this method, we show that the point process formed by the branching random walk and its minimum converge in law to a Poisson point process colored by a certain point process. This result, confirming a conjecture of Brunet and Derrida [10], can be viewed as a discrete analog of the corresponding results for the branching brownian motion, previously established by Arguin et a…
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.
Consider a branching random walk, where the branching mechanism is governed by a Galton-Watson process, and the migration by a finite range symmetric irreducible random walk on the integer lattice $\mathbb{Z}^d$. Let $Z_n(z)$ be the number of the particles in the $n$-th generation at the point $z\in \mathbb{Z}^d$. Under the mild moment conditions for offspring distribution of the underlying Galton-Watson, we derive a second order expansion in the local limit theorem for $Z_n(z)$ for each given $z\in \mathbb{Z}^d$. That generalizes the results for simple branching random walks obtained by Gao […
We consider a discrete-time branching random walk in the boundary case, where the associated random walk is in the domain of attraction of an $α$-stable law with $1<α<2$. We prove that the derivative martingale $D_n$ converges to a non-trivial limit $D_\infty$ under some regular conditions. We also study the additive martingale $W_n$, and prove $n^\frac{1}αW_n$ converges in probability to a constant multiple of $D_\infty$.
