Related papers: SPDE Approximation for Random Trees
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,…
Bayesian inference is now a leading technique for reconstructing phylogenetic trees from aligned sequence data. In this short note, we formally show that the maximum posterior tree topology provides a statistically consistent estimate of a…
Deciding whether there is a single tree -a supertree- that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this question: agreement and…
Motivated as a null model for comparison with data, we study the following model for a phylogenetic tree on $n$ extant species. The origin of the clade is a random time in the past, whose (improper) distribution is uniform on $(0,\infty)$.…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
The cactus of a pointed graph is a discrete tree associated with this graph. Similarly, with every pointed geodesic metric space $E$, one can associate an $\R$-tree called the continuous cactus of $E$. We prove under general assumptions…
Recently, so-called treebased phylogenetic networks have gained considerable interest in the literature, where a treebased network is a network that can be constructed from a phylogenetic tree, called the base tree, by adding additional…
Phylogenetic networks are a type of directed acyclic graph that represent how a set $X$ of present-day species are descended from a common ancestor by processes of speciation and reticulate evolution. In the absence of reticulate evolution,…
The solutions to a large class of semi-linear parabolic PDEs are given in terms of expectations of suitable functionals of a tree of branching particles. A sufficient, and in some cases necessary, condition is given for the integrability of…
In biology, a phylogenetic tree is a tool to represent the evolutionary relationship between species. Unfortunately, the classical Schr\"oder tree model is not adapted to take into account the chronology between the branching nodes. In…
A phylogenetic tree is a way to organize a finite set of species, individuals or other sources of related data. The species for which we have existing DNA data make up the set of leaves of the tree. The balanced minimal evolution method of…
By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…
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…
Phylogenetic trees describe the relationships between species in the evolutionary process, and provide information about the rates of diversification. To understand the mechanisms behind macroevolution, we consider a class of multitype…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
Generating function equation has been derived for the probability distribution of the number of nodes with $k \ge 0$ outgoing lines in randomly evolving special trees. The stochastic properties of end-nodes (k=0) have been analyzed, and it…
We prove that critical multitype Galton-Watson trees converge after rescaling to the Brownian continuum random tree, under the hypothesis that the offspring distribution has finite covariance matrices. Our study relies on an ancestral…
It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…
We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…