Related papers: Unimodularity for multi-type Galton-Watson trees
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 consider a Galton--Watson tree with offspring distribution $\nu$ of finite mean. The uniform measure on the boundary of the tree is obtained by putting mass $1$ on each vertex of the $n$-th generation and taking the limit $n\to \infty$.…
We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…
We consider the Ising model on a supercritical Galton-Watson tree $\mathbf{T}_n$ of depth $n$ with a sparse random external field, given by a collection of i.i.d. Bernouilli random variables with vanishing parameter $p_n$. This may me…
We consider multi-type Galton Watson trees, and find the distribution of these trees when conditioning on very general types of recursive events. It turns out that the conditioned tree is again a multi-type Galton Watson tree, possibly with…
Under minimal condition, we prove the local convergence of a critical multi-type Galton-Watson tree conditioned on having a large total progeny by types towards a multi-type Kesten's tree. We obtain the result by generalizing Neveu's strong…
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 consider a multitype Galton-Watson process that allows for the mutation and reversion of individual types in discrete and continuous time. In this setting, we explicitly compute the time evolution of quantities such as the mean and…
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…
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…
We consider the random conductance model, where the underlying graph is an infinite supercritical Galton--Watson tree, the conductances are independent but their distribution may depend on the degree of the incident vertices. We prove that,…
We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…
Let $\mathcal{T}$ denote a Galton--Watson tree with offspring distribution $\xi$ satisfying $\mathbb{E}(\xi) = 1$, and let $\mathcal{T}_n$ be the Galton--Watson tree conditioned to have exactly $n$ nodes. We show that, under a mild moment…
We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a…
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…
In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along 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…
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…
We study properties of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution is in the domain of attraction of a stable distribution with index $\alpha\in (1,2]$. Here the harmonic measure refers…
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…