Related papers: Invariance principles for pruning processes of Gal…

We give a simple new proof of a theorem of Duquesne, stating that the properly rescaled contour function of a critical aperiodic Galton-Watson tree, whose offspring distribution is in the domain of attraction of a stable law of index…

We consider a random walk on a Galton-Watson tree in random environment, in the subdiffusive case. We prove the convergence of the renormalised height function of the walk towards the continuous-time height process of a spectrally positive…

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…

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

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…

We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…

Recently, Abraham and Delmas constructed the distributions of super-critical L\'evy trees truncated at a fixed height by connecting super-critical L\'evy trees to (sub)critical L\'evy trees via a martingale transformation. A similar…

The aim of this lecture is to give an overview of old and new resultson Bienaym\'e-Galton-Watson (BGW) trees. After introducing the framework of discretetrees, we first give alternative proofs of classical results on theextinction…

We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…

We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We…

We establish sufficient mild conditions for a sequence of multitype Bienaym\'e-Galton-Watson trees, conditioned in some sense to be large, to converge to a limiting compact metric space which we call a \emph{multitype L\'{e}vy tree}. More…

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

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 consider a conditioned Galton-Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given length. We give two proofs of this result, one probabilistic and…

We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…

Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…

By studying an admissible family of branching mechanisms introduced in Li (2014), we obtain a pruning procedure on L\'evy trees. Then we could construct a decreasing L\'evy-CRT-valued process $\{{\mathcal T}_t\}$ by pruning L\'evy trees and…

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…

We show joint convergence of the Lukasiewicz path and height process for slightly supercritical Galton-Watson forests. This shows that the height processes for supercritical continuous state branching processes as constructed by Lambert…

We are interested in nodes with fixed outdegrees in large conditioned Galton--Watson trees. We first study the scaling limits of processes coding the evolution of the number of such nodes in different explorations of the tree…