Kingman’s coalescent is a random tree that arises from classical population ge-netic models such as the Moran model. The individuals alive in these models corre-spond to the leaves in the tree and the following two laws of large numbers concern-ing the structure of the tree-top are well-known: (i) The (shortest) distance, denoted by Tn, from the tree-top to the level when there are n lines in the tree satisfies nTn n→∞−−−− → 2 almost surely; (ii) At time Tn, the population is naturally partitioned in exactly n families where individuals belong to the same family if they have a com-mon ancestor at time Tn in the past. If Fi,n denotes the size of the ith family, then n(F 21,n + · · ·+ F 2n,n) n→∞−−−− → 2 almost surely. For both laws of large...
This dissertation is mainly comprised of two parts. Chapters 1-5 focus on nested coalescent models. ...
In phylogenetic analysis it is useful to study the distribution of parsimony length of a tree, under...
Abstract—The problem of maximum-likelihood (ML) estima-tion of discrete tree-structured distribution...
Kingman’s coalescent is a random tree that arises from classical population genetic models such as t...
Consider a random walk in random environment on a supercritical Galton–Watson tree, and let n be the...
8 pages, 8 figuresInternational audienceThe distributions of the times to the first common ancestor ...
We consider discrete time branching random walk on real line where the displacements of particles co...
Kingman\u27s classical coalescent uncovers the basic pattern ofgenealogical trees of random samples ...
Compared to V2 we only changed the presentation: several theorems have been merged and are now state...
AbstractWe explain how Itô’s excursion theory can be used to understand the asymptotic behavior of l...
Trees are a fundamental notion in graph theory and combinatorics as well as a basic object for data ...
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of ite...
Distributional properties of tree shape statistics under random phylogenetic tree models play an imp...
The goal of these lectures is to review some mathematical aspects of random tree models used in evol...
The Galton–Watson process is the simplest example of a branching process. The relationship between ...
This dissertation is mainly comprised of two parts. Chapters 1-5 focus on nested coalescent models. ...
In phylogenetic analysis it is useful to study the distribution of parsimony length of a tree, under...
Abstract—The problem of maximum-likelihood (ML) estima-tion of discrete tree-structured distribution...
Kingman’s coalescent is a random tree that arises from classical population genetic models such as t...
Consider a random walk in random environment on a supercritical Galton–Watson tree, and let n be the...
8 pages, 8 figuresInternational audienceThe distributions of the times to the first common ancestor ...
We consider discrete time branching random walk on real line where the displacements of particles co...
Kingman\u27s classical coalescent uncovers the basic pattern ofgenealogical trees of random samples ...
Compared to V2 we only changed the presentation: several theorems have been merged and are now state...
AbstractWe explain how Itô’s excursion theory can be used to understand the asymptotic behavior of l...
Trees are a fundamental notion in graph theory and combinatorics as well as a basic object for data ...
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of ite...
Distributional properties of tree shape statistics under random phylogenetic tree models play an imp...
The goal of these lectures is to review some mathematical aspects of random tree models used in evol...
The Galton–Watson process is the simplest example of a branching process. The relationship between ...
This dissertation is mainly comprised of two parts. Chapters 1-5 focus on nested coalescent models. ...
In phylogenetic analysis it is useful to study the distribution of parsimony length of a tree, under...
Abstract—The problem of maximum-likelihood (ML) estima-tion of discrete tree-structured distribution...