Currently displaying 1 – 5 of 5

Showing per page

Order by Relevance | Title | Year of publication

Ranked fragmentations

Julien Berestycki — 2002

ESAIM: Probability and Statistics

In this paper we define and study self-similar ranked fragmentations. We first show that any ranked fragmentation is the image of some partition-valued fragmentation, and that there is in fact a one-to-one correspondence between the laws of these two types of fragmentations. We then give an explicit construction of homogeneous ranked fragmentations in terms of Poisson point processes. Finally we use this construction and classical results on records of Poisson point processes to study the small-time...

Ranked Fragmentations

Julien Berestycki — 2010

ESAIM: Probability and Statistics

In this paper we define and study self-similar ranked fragmentations. We first show that any ranked fragmentation is the image of some partition-valued fragmentation, and that there is in fact a one-to-one correspondence between the laws of these two types of fragmentations. We then give an explicit construction of homogeneous ranked fragmentations in terms of Poisson point processes. Finally we use this construction and classical results on records of Poisson point processes to study the small-time behavior...

Small-time behavior of beta coalescents

Julien BerestyckiNathanaël BerestyckiJason Schweinsberg — 2008

Annales de l'I.H.P. Probabilités et statistiques

For a finite measure on [0, 1], the -coalescent is a coalescent process such that, whenever there are clusters, each -tuple of clusters merges into one at rate (1−) (d). It has recently been shown that if 1<<2, the -coalescent in which is the Beta (2−, ) distribution can be used to describe the genealogy of a continuous-state branching process (CSBP) with an -stable branching mechanism. Here we use facts...

Asymptotic sampling formulae for 𝛬 -coalescents

Julien BerestyckiNathanaël BerestyckiVlada Limic — 2014

Annales de l'I.H.P. Probabilités et statistiques

We present a robust method which translates information on the speed of coming down from infinity of a genealogical tree into sampling formulae for the underlying population. We apply these results to population dynamics where the genealogy is given by a 𝛬 -coalescent. This allows us to derive an exact formula for the asymptotic behavior of the site and allele frequency spectrum and the number of segregating sites, as the sample size tends to . Some of our results hold in the case of a general 𝛬 -coalescent...

Page 1

Download Results (CSV)