Related papers: The phase transition for parking on Galton--Watson…

We provide a complete picture of the local convergence of critical or subcritical Galton-Watson tree conditioned on having a large number of individuals with out-degree in a given set. The generic case, where the limit is a random tree with…

The contact process is a simple model for the spread of an infection in a structured population. We consider a variant of this process on Bienaym\'e-Galton-Watson trees, where vertices are equipped with a random fitness representing…

We consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the genealogy of the nested connected components…

Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…

Pruning processes $(\mathcal{F}(\theta),\theta\geq 0)$ have been studied separately for Galton-Watson trees and for L\'evy trees/forests. We establish here a limit theory that strongly connects the two studies. This solves an open problem…

We study the frog model with death on the biregular tree $\mathbb{T}_{d_1,d_2}$. Initially, there is a random number of awake and sleeping particles located on the vertices of the tree. Each awake particle moves as a discrete-time…

We prove that the speed of a $\lambda$-biased random walk on a supercritical Galton-Watson tree is differentiable for $\lambda$ such that the walk is ballistic and obeys a central limit theorem, and give an expression of the derivative…

In this paper we consider a random walk in random environment on a tree and focus on the boundary case for the underlying branching potential. We study the range $R\_n$ of this walk up to time $n$ and obtain its correct asymptotic in…

Consider a critical Galton-Watson process Z={Z_n: n=0,1,...} of index 1+alpha, alpha in (0,1]. Let S_k(j) denote the sum of the Z_n with n in the window [k,...,k+j), and M_m(j) the maximum of the S_k with k moving in [0,m-j]. We describe…

Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…

We give a necessary and sufficient condition for the convergence in distribution of a conditioned Galton-Watson tree to Kesten's tree. This yields elementary proofs of Kesten's result as well as other known results on local limit of…

We consider random walks indexed by arbitrary finite random or deterministic trees. We derive a simple sufficient criterion which ensures that the maximal displacement of the tree-indexed random walk is determined by a single large jump.…

In this paper we complete the analysis of a statistical mechanics model on Cayley trees of any degree, started in [EsHaRo12,EsRo10,BoEsRo13,JaKuBo14,Bo17]. The potential is of nearest-neighbor type and the local state space is compact but…

We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…

We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with rate proportional to the local time at…

Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…

Assuming that a quantum field theory with a $\theta$-vacuum term in the action shows non-trivial $\theta$-dependence and provided that some reasonable properties of the probability distribution function of the order parameter hold, we argue…

We study $\lambda$-biased branching random walks on Bienaym\'e--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a…

The simple Galton--Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of…

To help with the planning of inter-vehicular communication networks, an accurate understanding of traffic behavior and traffic phase transition is required. We calculate inter-vehicle spacings from empirical data collected in a multi-lane…