Related papers: Non-fringe subtrees in conditioned Galton--Watson …
A multitype Dawson-Watanabe process is conditioned, in subcritical and critical cases, on non-extinction in the remote future. On every finite time interval, its distribution is absolutely continuous with respect to the law of the…
We prove that any graph $G$ with $n$ points has a distribution $\mathcal{T}$ over spanning trees such that for any edge $(u,v)$ the expected stretch $E_{T \sim \mathcal{T}}[d_T(u,v)/d_G(u,v)]$ is bounded by $\tilde{O}(\log n)$. Our result…
By introducing a new measure for the infinite Galton-Watson process and providing estimates for (discrete) Green's functions on trees, we establish the asymptotic behavior of the capacity of critical branching random walks: in high…
We establish uniform sub-exponential tail bounds for the width, height and maximal outdegree of critical Bienaym\'e-Galton-Watson trees conditioned on having a large fixed size, whose offspring distribution belongs to the domain of…
We prove that the speed of $\lambda$-biased random walks on a supercritical Galton-Watson tree without leaves is differentiable when $\lambda\in(0,1)$, and give an expression of the derivative using a certain 2-dimensional Gaussian random…
We study two different versions of the simple exclusion process on augmented Galton-Watson trees, the constant speed model and the varying speed model. In both cases, the simple exclusion process starts from an equilibrium distribution with…
Branching processes pervade many models in statistical physics. We investigate the survival probability of a Galton-Watson branching process after a finite number of generations. We reveal the finite-size scaling law of the survival…
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 show that large critical multi-type Galton-Watson trees, when conditioned to be large, converge locally in distribution to an infinite tree which is analoguous to Kesten's infinite monotype Galton-Watson tree. This is proven when we…
Given a super-critical Galton-Watson process $\{Z_n\}$ and a positive sequence $\{\epsilon_n\}$, we study the limiting behaviors of $P(S_{Z_n}/Z_n\geq\epsilon_n)$ and $P(S_{Z_n}/m^n\geq\epsilon_n) $ with sums $S_{n}$ of i.i.d. random…
We give a realization of the stable L\'evy forest of a given size conditioned by its mass from the path of the unconditioned forest. Then, we prove an invariance principle for this conditioned forest by considering $k$ independent…
We study nongeneric planar trees and prove the existence of a Gibbs measure on infinite trees obtained as a weak limit of the finite volume measures. It is shown that in the infinite volume limit there arises exactly one vertex of infinite…
Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support…
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…
We introduce a non-increasing tree growth process $((T_n,\sigma_n),\, n\ge 1)$, where $T_n$ is a rooted labeled tree on $n$ vertices and ${\sigma}_n$ is a permutation of the vertex labels. The construction of $(T_{n},{\sigma}_n)$ from…
We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…
In this paper, we address the problem of packing large trees in $G_{n,p}$. In particular, we prove the following result. Suppose that $T_1, \dotsc, T_N$ are $n$-vertex trees, each of which has maximum degree at most $(np)^{1/6} / (\log…
We study a branching random walk (BRW) taking its values in a random tree $\bT$ (seen as a family tree) with an infinite line of ancestors that is a variant of a supercritical Galton--Watson (GW) tree with offspring distribution $\nu$. The…
In this paper, we study the time required for a {\lambda}-biased ({\lambda}>1) walk to visit all the vertices of a supercritical Galton-Watson tree up to generation n. Inspired by the extremal landscape approach in [Cortines, Louidor,…
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…