Related papers: Random trees with local catastrophes: the Brownian…
This paper delves into the impact of natural disasters on affected populations and underscores the imperative of reducing disaster-related fatalities through proactive strategies. On average, approximately 45,000 individuals succumb…
Forest-fire and avalanche models support the notion that frequent catastrophes prevent the growth of very large populations and as such prevent rare large-scale catastrophes. We show that this notion is not universal. A new model class…
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…
Various combinatorial classes such as outerplanar graphs and maps, series-parallel graphs, substitution-closed classes of permutations and many more allow bijective encodings by so-called enriched trees, which are rooted trees with…
Random spanning trees are among the most prominent determinantal point processes. We give four examples of random spanning trees on ladder-like graphs whose rungs form stationary renewal processes or regenerative processes of order two,…
Consider a branching Markov process with values in some general type space. Conditional on survival up to generation $N$, the genealogy of the extant population defines a random marked metric measure space, where individuals are marked by…
We study fine properties of L\'evy trees that are random compact metric spaces introduced by Le Gall and Le Jan in 1998 as the genealogy of continuous state branching processes. L\'evy trees are the scaling limits of Galton-Watson trees and…
Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
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.…
Let $t$ be a rooted tree and $n_i(t)$ the number of nodes in $t$ having $i$ children. The degree sequence $(n_i(t),i\geq 0)$ of $t$ satisfies $\sum_{i\ge 0} n_i(t)=1+\sum_{i\ge 0} in_i(t)=|t|$, where $|t|$ denotes the number of nodes in…
We are interested in the asymptotics of random trees built by linear preferential attachment, also known in the literature as Barab\'asi-Albert trees or plane-oriented recursive trees. We first prove a conjecture of Bubeck, Mossel \& R\'acz…
Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…
We study the maximal degree of (sub)critical L{\'e}vy trees which arise as the scaling limits of Bienaym{\'e}-Galton-Watson trees. We determine the genealogical structure of large nodes and establish a Poissonian decomposition of the tree…
We study the evolution of the population genealogy in the classic neutral Moran Model of finite size and in discrete time. The stochastic transformations that shape a Moran population can be realized directly on its genealogy and give rise…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
We consider a Brownian tree consisting of a collection of one-dimensional Brownian paths started from the origin, whose genealogical structure is given by the Continuum Random Tree (CRT). This Brownian tree may be generated from the…
Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…
Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…
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,…