Related papers: Rerooting multi-type branching trees: the infinite…
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,…
Since the work of Aldous and Pitman (1998), several authors have studied the pruning processes of Galton-Watson trees and their continuous analogue L\'evy trees. L\"ohr, Voisin and Winter (2015) introduced the space of bi-measure…
This article studies the limit of binary search trees drawn from Mallows permutations under various topologies. The main result, pertaining to the standard local topology for graphs, requires the introduction of a generalization of binary…
We will give a criterion for the amenability of arbitrary locally finite trees. The criterion is based on the trimming operator which is defined on the space of trees. As an application, we obtain a necessary and sufficient condition for…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
We consider the set of random Bienaym\'e-Galton-Watson trees with a bounded number of offspring and bounded number of generations as a statistical mechanics model: a random tree is a rooted subtree of the maximal tree; the spin at a given…
We establish a general sufficient condition for a sequence of Galton Watson branching processes in varying environment to converge weakly. This condition extends previous results by allowing offspring distributions to have infinite…
Consider a Markov chain on the space of rooted real binary trees that randomly removes leaves and reinserts them on a random edge and suitably rescales the lengths of edges. This chain was introduced by David Aldous who conjectured a…
We introduce multi-type Markov Branching trees, which are simple random population tree models where individuals are characterized by their size and type and give rise to (size,type)-children in a Galton-Watson fashion, with the rule that…
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…
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…
We prove a strong form of the invariance under re-rooting of the distribution of the continuous random trees called Levy trees. This extends previous results due to several authors.
In [1] a detailed analysis was given of the large-time asymptotics of the total mass of the solution to the parabolic Anderson model on a supercritical Galton-Watson random tree with an i.i.d. random potential whose marginal distribution is…
We prove a law of large numbers for the range of rotor walks with random initial configuration on regular trees and on Galton-Watson trees. More precisely, we show that on the classes of trees under consideration, even in the case when the…
We show that the number of copies of a given rooted tree in a conditioned Galton-Watson tree satisfies a law of large numbers under a minimal moment condition on the offspring distribution.
We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
We prove singularity of some distributions of random continued fractions that correspond to iterated function systems with overlap and a parabolic point. These arose while studying the conductance of Galton-Watson trees.
We consider critical multitype Bienaym\'e trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first,…
We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree…