Related papers: An invariance principle for conditioned trees
We introduce and study a model of plane random trees generalizing the famous Bienaym\'e--Galton--Watson model but where births and deaths are locally correlated. More precisely, given a random variable $(B,H)$ with values in $\{1,2,3,…
We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on itsout-degree. Using a penalization method, we exhibit new martingales where the number of marks up to level n -- 1…
We consider an interacting particle system on trees known as the frog model: initially, a single active particle begins at the root and i.i.d.~$\mathrm{Poiss}(\lambda)$ many inactive particles are placed at each non-root vertex. Active…
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…
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…
Tree-structured data naturally appear in various fields, particularly in biology where plants and blood vessels may be described by trees, but also in computer science because XML documents form a tree structure. This paper is devoted to…
We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root,…
We consider a model of random loops on Galton-Watson trees with an offspring distribution with high expectation. We give the configurations a weighting of $\theta^{\#\text{loops}}$. For many $\theta>1$ these models are equivalent to certain…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
We study biased random walk on subcritical and supercritical Galton-Watson trees conditioned to survive in the transient, sub-ballistic regime. By considering offspring laws with infinite variance, we extend previously known results for the…
We prove an invariance principle for a general class of continuous time critical branching processes with finite variance (non-local) branching mechanism. We show that the genealogical trees, viewed as random compact metric measure spaces,…
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 introduce the notion of a hereditary property for rooted real trees and we also consider reduction of trees by a given hereditary property. Leaf-length erasure, also called trimming, is included as a special case of hereditary reduction.…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…
We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…
The study of Gaussian free field level sets on supercritical Galton-Watson trees has been initiated by Ab\"acherli and Sznitman in Ann. Inst. Henri Poincar\'{e} Probab. Stat., 54(1):173--201, 2018. By means of entirely different tools, we…
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 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 generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…