• Corpus ID: 17797011

# -coalescents and stable Galton-Watson trees

@inproceedings{Abraham2013coalescentsAS,
title={-coalescents and stable Galton-Watson trees},
author={Romain Abraham and Jean-François Delmas},
year={2013}
}
• Published 2013
• Mathematics
. 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 β (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 β (1 + α, 1 − α )-coalescent, with α ∈ [1 / 2 , 1) starting from the trivial partition of the n ﬁrst integers. The construction can also be made directly on the…

## Figures from this paper

On hitting probabilities of beta coalescents and absorption times of coalescents that come down from infinity
• Mathematics
• 2014
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
THE COLLISION SPECTRUM OF -COALESCENTS1
• Physics, Mathematics
• 2018
-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to initially n
The size of the last merger and time reversal in $\Lambda$-coalescents
• Mathematics
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
• 2018
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
The fixation line in the Λ -coalescent.
We define a Markov process in a forward population model with backward genealogy given by the -coalescent. This Markov process, called the fixation line, is related to the block counting process
Invariant Galton-Watson trees: metric properties and attraction with respect to generalized dynamical pruning
• Mathematics
• 2022
Invariant Galton-Watson (IGW) tree measures is a one-parameter family of critical Galton-Watson measures invariant with respect to a large class of tree reduction operations. Such operations include
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
The collision spectrum of $\Lambda$-coalescents
• Physics, Mathematics
The Annals of Applied Probability
• 2018
$\Lambda$-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to
A line-breaking construction of the stable trees
• Mathematics
• 2014
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
On the size of the block of 1 for $\varXi$-coalescents with dust
• Mathematics
• 2017
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
Scaling limits for a family of unrooted trees
We introduce weights on the unrooted unlabelled plane trees as follows: let $\mu$ be a probability measure on the set of nonnegative integers whose mean is no larger than $1$; then the $\mu$-weight

## References

SHOWING 1-10 OF 55 REFERENCES
BETA-COALESCENTS AND CONTINUOUS STABLE RANDOM TREES
• Mathematics
• 2007
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.
The cut-tree of large Galton-Watson trees and the Brownian CRT
• Mathematics
• 2012
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
On Asymptotics of the Beta Coalescents
• Mathematics
Advances in Applied Probability
• 2014
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
Random Recursive Trees and the Bolthausen-Sznitman Coalesent
• Mathematics
• 2005
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
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
A Construction of a β-Coalescent via the Pruning of Binary Trees
• Computer Science, Mathematics
Journal of Applied Probability
• 2013
Considering a random binary tree with n labelled leaves, we use a pruning procedure on this tree in order to construct a β(3/2,1/2)-coalescent process. We also use the continuous analogue of this
Random Trees, Levy Processes and Spatial Branching Processes
• Mathematics
• 2002
We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this
Rayleigh processes, real trees, and root growth with re-grafting
• Mathematics
• 2004
The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree.