Related papers: Conditioning Galton-Watson trees on large maximal …

We study the random planar maps obtained from supercritical Galton--Watson trees by adding the horizontal connections between successive vertices at each level. These are the hyperbolic analog of the maps studied by Curien, Hutchcroft and…

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

We prove that the speed of a biased random walk on a supercritical Galton-Watson tree conditioned to survive is analytic within the ballistic regime. This extends the previous work arXiv:1906.07913 in which it was shown that the speed is…

Invariant Galton-Watson (IGW) tree measures is a one-parameter family of critical Galton-Watson measures invariant with respect to a large class of tree reduction operations. Such operations include the generalized dynamical pruning (also…

Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…

We establish a phase transition for the parking process on critical Galton--Watson trees. In this model, a random number of cars with mean $m$ and variance $\sigma^{2}$ arrive independently on the vertices of a critical Galton--Watson tree…

We consider so-called discrete snakes obtained from size-conditioned critical Bienaym\'e-Galton-Watson trees by assigning to each node a random spatial position in such a way that the increments along each edge are i.i.d. When the offspring…

We are interested in the structure of large Bienaym\'e-Galton-Watson random trees whose offspring distribution is critical and falls within the domain of attraction of a stable law of index $\alpha=1$. In stark contrast to the case $\alpha…

We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength b_c exists such that most walks find the target within a finite time when b>b_c. For b<b_c,…

In this paper we consider random walks on Galton-Watson trees with random conductances. On these trees, the distance of the walker to the root satisfies a law of large numbers with limit the effective velocity, or speed of the walk. We…

In this paper we consider inhomogeneous Galton-Watson trees, and derive various moments for such processes: the number of vertices, the number of leaves, and the height of the tree. Also we make a simple condition of finiteness. We use…

Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…

Evans defines a notion of what it means for a set B to be polar for a process indexed by a tree. The main result herein is that a tree picked from a Galton-Watson measure whose offspring distribution has mean m and finite variance will…

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…

At each site of a supercritical Galton-Watson tree place a parking spot which can accommodate one car. Initially, an independent and identically distributed number of cars arrive at each vertex. Cars proceed towards the root in discrete…

The biased random walk on supercritical Galton--Watson trees is known to exhibit a multiscale phenomenon in the slow regime: the maximal displacement of the walk in the first $n$ steps is of order $(\log n)^3$, whereas the typical…

We prove a scaling limit theorem for discrete Galton-Watson processes in varying environments. A simple sufficient condition for the weak convergence in the Skorokhod space is given in terms of probability generating functions. The limit…

Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…

We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in…

In this article, we prove a joint large deviation principle in $n$ for the \emph{empirical pair measure} and \emph{ empirical offspring measure} of critical multitype Galton-Watson trees conditioned to have exactly $n$ vertices in the weak…