Search

We consider the genealogical tree of a stationary continuous state branching process with immigration. For a sub-critical stable branching mechanism, we consider the genealogical tree of the extant population at some fixed time and prove that, up to a deterministic time-change, it is distributed as a continuous-time Galton–Watson process with immigration. We obtain similar results for a critical stable branching mechanism when only looking at immigrants arriving in some fixed time-interval. For a general sub-critical branching mechanism, we consider the number of individuals that give descendants in the extant population. The associated processes (forward or backward in time) are pure-death or pure-birth Markov processes, for which we compute the transition rates. [ABSTRACT FROM AUTHOR]

We study the pruning process developed by Abraham and Delmas (2012) on the discrete Galton–Watson sub-trees of the Lévy tree which are obtained by considering the minimal sub-tree connecting the root and leaves chosen uniformly at rate λ , see Duquesne and Le Gall (2002). The tree-valued process, as λ increases, has been studied by Duquesne and Winkel (2007). Notice that we have a tree-valued process indexed by two parameters: the pruning parameter θ and the intensity λ . Our main results are: construction and marginals of the pruning process, representation of the pruning process (forward in time that is as θ increases) and description of the growing process (backward in time that is as θ decreases) and distribution of the ascension time (or explosion time of the backward process) as well as the tree at the ascension time. A by-product of our result is that the super-critical Lévy trees independently introduced by Abraham and Delmas (2012) and Duquesne and Winkel (2007) coincide. This work is also related to the pruning of discrete Galton–Watson trees studied by Abraham, Delmas and He (2012). [ABSTRACT FROM AUTHOR]

We perform a pruning procedure on a Lévy tree and instead of throwing away the removed sub-tree, we regraft it on a given branch (not related to the Lévy tree). We prove that the tree constructed by regrafting is distributed as the original Lévy tree, generalizing a result of Addario-Berry, Broutin and Holmgren where only Aldous’s tree is considered. As a consequence, we obtain that the “average pruning time” of a leaf is distributed as the height of a leaf picked at random in the Lévy tree. [ABSTRACT FROM AUTHOR]

Abstract: We consider the bifurcating Markov chain model introduced by Guyon to detect cellular aging from cell lineage. To take into account the possibility for a cell to die, we use an underlying super-critical binary Galton–Watson process to describe the evolution of the cell lineage. We give in this more general framework a weak law of large number, an invariance principle and thus fluctuation results for the average over all individuals in a given generation, or up to a given generation. We also prove that the fluctuations over each generation are independent. Then we present the natural modifications of the tests given by Guyon in cellular aging detection within the particular case of the auto-regressive model. [ABSTRACT FROM AUTHOR]

Abstract: We consider an initial Eve-population and a population of neutral mutants, such that the total population dies out in finite time. We describe the evolution of the Eve-population and the total population with continuous state branching processes, and the neutral mutation procedure can be seen as an immigration process with intensity proportional to the size of the population. First we establish a Williams’ decomposition of the genealogy of the total population given by a continuum random tree, according to the ancestral lineage of the last individual alive. This allows us to give a closed formula for the probability of simultaneous extinction of the Eve-population and the total population. [Copyright &y& Elsevier]

Abstract: We consider the height process of a Lévy process with no negative jumps, and its associated continuous tree representation. Using tools developed by Duquesne and Le Gall, we construct a fragmentation process at height, which generalizes the fragmentation at height of stable trees given by Miermont. In this more general framework, we recover that the dislocation measures are the same as the dislocation measures of the fragmentation at nodes introduced by Abraham and Delmas, up to a factor equal to the fragment size. We also compute the asymptotics for the number of small fragments. [Copyright &y& Elsevier]

Using an approximating scheme with the Brownian snake, we prove the existence of solution to a martingale problem for super Brownian motion with interactions. [Copyright &y& Elsevier]