Related papers: Most trees are short and fat
We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…
We study the local limit in distribution of Bienaym{\'e}-Galton-Watson trees conditioned on having large sub-populations. Assuming a generic and aperiodic condition on the offspring distribution, we prove the existence of a limit given by a…
The metric dimension of a graph $G$ is the minimal size of a subset $R$ of vertices of $G$ that, upon reporting their graph distance from a distingished (source) vertex $v^\star$, enable unique identification of the source vertex $v^\star$…
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 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 derive an upper bound for the annealed return probability for the simple random walk on supercritical Bienaym\'e-Galton-Watson trees. The bound decays subexponentially in time $t$ with $t^{1/3}$ in the exponent. It is valid for all…
We investigate the range $\mathcal{R}_T$ of the diffusive biased walk $\mathbb{X}$ on a Galton-Watson tree $\mathbb{T}$ in random environment, that is to say the sub-tree of $\mathbb{T}$ of all distinct vertices visited by this walk up to…
We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation…
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 study the typical behavior of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution has finite variance. The harmonic measure considered here refers to the hitting distribution of height $n$ by…
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 a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour, which started from the root of a tree, spreads out through an infinite…
We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively. For an arbitrary finite tree, we show that the number of…
We show that in abelian sandpiles on infinite Galton-Watson trees, the probability that the total avalanche has more than $t$ topplings decays as $t^{-1/2}$. We prove both quenched and annealed bounds, under suitable moment conditions. Our…
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 show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than $\eps$, agrees up to generation $K$ with a regular $\mu$-ary tree, where $\mu$ is the essential minimum of the offspring distribution and…
In this paper we present various new inequalities for tail proabilities for distributions that are elements of the most improtant exponential families. These families include the Poisson distributions, the Gamma distributions, the binomial…
This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…
We use local limits of Galton-Watson trees to establish local limit theorems for permutations conditioned to avoid a pattern of length three. In the case of 321-avoiding permutations our results resolve an open problem of Pinsky. In the…
The Horton-Strahler number, also known as the register function, provides a tool for quantifying the branching complexity of a rooted tree. We consider the Horton-Strahler number of critical Galton-Watson trees conditioned to have size $n$…