Related papers: Branching random walks and contact processes on Ga…
We investigate the quasi-limiting behaviour of bisexual subcritical Galton-Watson branching processes. While classical subcritical Galton-Watson processes have been extensively analyzed, bisexual Galton-Watson branching processes present…
We study the contact process on random graphs with low infection rate $\lambda$. For random $d$-regular graphs, it is known that the survival time is $O(\log n)$ below the critical $\lambda_c$. By contrast, on the Erd\H{o}s-R\'enyi random…
We study a continuous time branching process where an individual splits into two daughters with rate b and dies with rate a, starting from a single individual at t=0. We show that the model can be mapped exactly to a random walk problem…
We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…
We consider a supercritical Galton-Watson branching process with immigration. It is well known that under suitable conditions on the offspring and immigration distributions, there is a finite, strictly positive limit ${\mathcal{W}}$ for the…
We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…
In this paper, we study the time required for a {\lambda}-biased ({\lambda}>1) walk to visit all the vertices of a supercritical Galton-Watson tree up to generation n. Inspired by the extremal landscape approach in [Cortines, Louidor,…
We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…
We study one specific version of the contact process on a graph. Here, we allow multiple infections carried by the nodes and include a probability of removing nodes in a graph. The removal probability is purely determined by the number of…
This paper considers linear functions constructed on two different weighted branching processes and provides explicit bounds for their Kantorovich-Rubinstein distance in terms of couplings of their corresponding generic branching vectors.…
In the standard SIR model on a graph, infected vertices infect their neighbors at rate $\alpha$ and recover at rate $\mu$. We consider a two-type SIR process where each individual in the graph can be infected with two types of diseases, $A$…
Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for $r$-neighbour bootstrap percolation on Galton--Watson trees in…
We consider the critical Galton-Watson process with overlapping generations stemming from a single founder. Assuming that both the variance of the offspring number and the average generation length are finite, we establish the convergence…
We give an expression of the speed of the biased random walk on a Galton--Watson tree. In the particular case of the simple random walk, we recover the result of Lyons, Pemantle and Peres \cite{LyPePe95}. The proof uses a description of the…
We study the exploration (or height) process of a continuous time non-binary Galton-Watson random tree, in the subcritical, critical and supercritical cases. Thus we consider the branching process in continuous time (Z_{t})_{t\geq 0}, which…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
We consider branching random walks built on Galton--Watson trees with offspring distribution having a bounded support, conditioned to have $n$ nodes, and their rescaled convergences to the Brownian snake. We exhibit a notion of ``globally…
Linear fractional Galton-Watson branching processes in i.i.d.~random environment are, on the quenched level, intimately connected to random difference equations by the evolution of the random parameters of their linear fractional marginals.…
In this paper we study the genealogical structure of a Galton-Watson process with neutral mutations, where the initial population is large and mutation rate is small \cite{B2}. Namely, we extend in two directions the results obtained in…
We consider an interacting particle system on trees known as the frog model: initially, a single active particle begins at the root and i.i.d.~$\mathrm{Poiss}(\lambda)$ many inactive particles are placed at each non-root vertex. Active…