• Corpus ID: 116958390

$\beta$-coalescents and stable Galton-Watson trees

@article{Abraham2013betacoalescentsAS,
  title={\$\beta\$-coalescents and stable Galton-Watson trees},
  author={Romain Abraham and Jean-François Delmas},
  journal={ALEA-Latin American Journal of Probability and Mathematical Statistics},
  year={2013},
  volume={12},
  pages={451-476}
}
Representation of coalescent process using pruning of trees has been used by Goldschmidt and Martin for the Bolthausen-Sznitman coalescent and by Abraham and Delmas for the $\beta(3/2,1/2)$-coalescent. By considering a pruning procedure on stable Galton-Watson tree with $n$ labeled leaves, we give a representation of the discrete $\beta(1+\alpha,1-\alpha)$-coalescent, with $\alpha\in [1/2,1)$ starting from the trivial partition of the $n$ first integers. The construction can also be made… 

Figures from this paper

The vertex-cut-tree of Galton–Watson trees converging to a stable tree
We consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the
The fixation line in the ${\Lambda}$-coalescent
We define a Markov process in a forward population model with backward genealogy given by the $\Lambda$-coalescent. This Markov process, called the fixation line, is related to the block counting
On the size of the block of 1 for $\varXi$-coalescents with dust
We study the frequency process $f_1$ of the block of 1 for a $\varXi$-coalescent $\varPi$ with dust. If $\varPi$ stays infinite, $f_1$ is a jump-hold process which can be expressed as a sum of broken
The size of the last merger and time reversal in $\Lambda$-coalescents
Author(s): Kersting, Goetz; Schweinsberg, Jason; Wakolbinger, Anton | Abstract: We consider the number of blocks involved in the last merger of a $\Lambda$-coalescent started with $n$ blocks. We give
A line-breaking construction of the stable trees
We give a new, simple construction of the $\alpha$-stable tree for $\alpha \in (1,2]$. We obtain it as the closure of an increasing sequence of $\mathbb{R}$-trees inductively built by gluing together
Cutting and rebuilding random trees and maps
This PhD thesis is divided into two parts. First, we study some fragmentations of random trees and the associated cut-trees. The discrete models we are interested in are Galton-Watson trees, which
On hitting probabilities of beta coalescents and absorption times of coalescents that come down from infinity
Let X = (Xk)k=0;1;::: denote the jump chain of the block counting process of the -coalescent with = (2 ; ) being the beta distribution with parameter 2 (0;2). A solution for the hitting probability
Stick-breaking PG(\alpha,\zeta)-Generalized Gamma Processes
This work centers around results related to Proposition 21 of Pitman and Yor's (1997) paper on the two parameter Poisson Dirichlet distribution indexed by (\alpha,\theta) for 0 -\alpha, denoted
Sweepstake evolution revealed by population-genetic analysis of copy-number alterations in single genomes of breast cancer
TLDR
The estimated parameters suggest that breast cancer cells underwent sweepstake evolution, where only one or very few parental cells produced a descendent cell population, and the high reproduction of only a portion of cancer cells may confer high adaptability to this cancer.
A survey of the -coalescents
coalescents model evolution of a coalescing system in which any number of com- ponents randomly sampled from the whole may merge in larger blocks. This survey focuses on related combinatorial
...
...

References

SHOWING 1-10 OF 42 REFERENCES
Alpha-Stable Branching and Beta-Coalescents
We determine that the continuous-state branching processes for which the genealogy, suitably time-changed, can be described by an autonomous Markov process are precisely those arising from
The cut-tree of large Galton-Watson trees and the Brownian CRT
Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of
Pruning Galton-Watson Trees and Tree-valued Markov Processes
TLDR
Under a mild condition on offspring distributions, it is shown that the process $\cal G(u)$ run until its ascension time has a representation in terms of $\{{\cal G}^*(u)\}$.
Random Recursive Trees and the Bolthausen-Sznitman Coalesent
We describe a representation of the Bolthausen-Sznitman coalescent in terms of the cutting of random recursive trees. Using this representation, we prove results concerning the final collision of the
The fixation line in the ${\Lambda}$-coalescent
We define a Markov process in a forward population model with backward genealogy given by the $\Lambda$-coalescent. This Markov process, called the fixation line, is related to the block counting
BETA-COALESCENTS AND CONTINUOUS STABLE RANDOM TREES
TLDR
It is proved that Beta-coalescents can be embedded in continuous stable random trees based on a construction of the Donnelly-Kurtz lookdown process using continuous random trees, which is of independent interest.
On Asymptotics of the Beta Coalescents
We show that the total number of collisions in the exchangeable coalescent process driven by the beta (1, b) measure converges in distribution to a 1-stable law, as the initial number of particles
A limit theorem for the contour process of condidtioned Galton--Watson trees
In this work, we study asymptotics of the genealogy of Galton--Watson processes conditioned on the total progeny. We consider a fixed, aperiodic and critical offspring distribution such that the
Coalescents with multiple collisions
k−2 � 1 − xb−k � � dx� . Call this process a � -coalescent. Discrete measure-valued processes derived from the � -coalescent model a system of masses undergoing coalescent collisions. Kingman's
Pruning of CRT-sub-trees
...
...