Related papers: Approximation of the Height process of a CSBP with…
Consider a continuous-time binary branching process conditioned to have population size n at some time t, and with a chance p for recording each extinct individual in the process. Within the family tree of this process, we consider the…
Scaling limits for continuous-time branching processes with discrete state space are provided as the initial state tends to infinity. Depending on the finiteness or non-finiteness of the mean and/or the variance of the offspring…
In the case of neutral populations of fixed sizes in equilibrium whose genealogies are described by the Kingman $N$-coalescent back from time $t$ consider the associated processes of total tree length as $t$ increases. We show that the…
A density-dependent branching process is a particle system in which individuals reproduce independently, but in a way that depends on the current population size. This feature can model a wide range of ecological interactions at the cost of…
We encode the genealogy of a continuous-state branching process associated with a branching mechanism $\Psi$ - or $\Psi$-CSBP in short - using a stochastic flow of partitions. This encoding holds for all branching mechanisms and appears as…
We consider a random walk on a Galton-Watson tree whose offspring distribution has a regular varying tail of order $\kappa\in (1,2)$. We prove the convergence of the renormalised height function of the walk towards the continuous-time…
The recently discovered correspondence between the distribution of rapidity gaps in electron-nucleus diffractive processes and the statistics of the height of genealogical trees in branching random walks is reviewed. In addition, a new…
Crump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing individuals to live for an arbitrary duration and give birth at arbitrary times during their life-time. In this paper, we are interested in the height and contour…
Consider the population model with infinite size associated to subcritical continuous-state branching processes (CSBP). Individuals reproduce independently according to the same subcritical offspring distribution. We study the long-term…
We characterise all the quasi-stationary distributions and the Q-process associated with a continuous state branching process that explodes in finite time. We also provide a rescaling for the continuous state branching process conditioned…
We study evolving genealogies, i.e. processes that take values in the space of (marked) ultra-metric measure spaces and satisfy some sort of "consistency" condition. This condition is based on the observation that the genealogical distance…
We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the…
We define symmetric and asymmetric branching trees, a class of processes particularly suited for modeling genealogies of inhomogeneous populations where individuals may reproduce throughout life. In this framework, a broad class of…
We show that genealogical trees arising from a broad class of non-neutral models of population evolution converge to the Kingman coalescent under a suitable rescaling of time. As well as non-neutral biological evolution, our results apply…
Real networks often grow through the sequential addition of new nodes that connect to older ones in the graph. However, many real systems evolve through the branching of fundamental units, whether those be scientific fields, countries, or…
Branching-stable processes have recently appeared as counterparts of stable subordinators, when addition of real variables is replaced by branching mechanism for point processes. Here, we are interested in their domains of attraction and…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
Continuous-time branching processes (CTBPs) are powerful tools in random graph theory, but are not appropriate to describe real-world networks, since they produce trees rather than (multi)graphs. In this paper we analyze collapsed branching…
We consider the continuous-time version of the random digital search tree, and construct a coupling with a border aggregation model as studied in Thacker and Volkov (2018), showing a relation between the height of the tree and the time…
The number of extant individuals within a lineage, as exemplified by counts of species numbers across genera in a higher taxonomic category, is known to be a highly skewed distribution. Because the sublineages (such as genera in a clade)…