A construction of a -coalescent via the pruning of binary trees

DOI10.1239/JAP/1378401235MaRDI QIDQ2854080zbMATH OpenOpenAlexFDO

Authors Romain Abraham, Jean-François Delmas

Publication date 17 October 2013

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.5629, https://projecteuclid.org/euclid.jap/1378401235

zbMATH Keywords

pruningbinary treecontinuum random treecoalescent process

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: Considering a random binary tree with $n$ labelled leaves, we use a pruning procedure on this tree in order to construct a $$-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous's continuum random tree, to construct a continuous state space process that has the same structure as the $$-coalescent process up to some time change. These two constructions unable us to obtain results on the coalescent process such as the asymptotics on the number of coalescent events or the law of the blocks involved in the last coalescent event.

Recommendations

• \(\beta\)-coalescents and stable Galton-Watson trees
• Beta-coalescents and continuous stable random trees
• The asymptotic distribution of the length of beta-coalescent trees
• Random recursive trees and the Bolthausen-Sznitman coalescent
• The coalescent structure of continuous-time Galton-Watson trees
• Asymptotic results on the length of coalescent trees
• The coalescent of a sample from a binary branching process
• Alpha-stable branching and beta-coalescents
• The coalescent tree of a Markov branching process with generalised logistic growth
• On the total length of external branches for beta-coalescents

Cites work

• scientific article; zbMATH DE number 1859371 (Why is no real title available?)
• A continuum-tree-valued Markov process
• Alpha-stable branching and beta-coalescents
• Beta-coalescents and continuous stable random trees
• Coalescents with multiple collisions
• Exponential functionals of Lévy processes
• Fluctuations for the number of records on subtrees of the continuum random tree
• On Ruelle's probability cascades and an abstract cavity method
• On \(\Lambda \)-coalescents with dust component
• On the number of jumps of random walks with a barrier
• Poisson snake and fragmentation
• Pruning a Lévy continuum random tree
• Pruning of CRT-sub-trees
• Random cutting and records in deterministic and random trees
• Random real trees
• Random recursive trees and the Bolthausen-Sznitman coalescent
• Recent progress in coalescent theory.
• Record process on the continuum random tree
• Smaller population size at the MRCA time for stationary branching processes
• Stable continuous-state branching processes with immigration and Beta-Fleming-Viot processes with immigration
• The coalescent
• The continuum random tree. I
• The continuum random tree. III
• The standard additive coalescent

Cited in

(8)

• On a ternary coalescent process
• On the size of the block of 1 for \(\varXi\)-coalescents with dust
• The collision spectrum of \(\Lambda\)-coalescents
• The size of the last merger and time reversal in \(\Lambda\)-coalescents
• Beta-coalescents and continuous stable random trees
• \(\Lambda\)-coalescents: a survey
• \(\beta\)-coalescents and stable Galton-Watson trees
• The fixation line in the \(\Lambda\)-coalescent

This page was built for publication: A construction of a \(\beta \)-coalescent via the pruning of binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854080)