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

DOI10.1239/JAP/1378401235zbMATH Open1285.60078arXiv1206.5629OpenAlexW2082825787MaRDI QIDQ2854080FDOQ2854080

Authors: Romain Abraham, Jean-François Delmas 

Publication date: 17 October 2013

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

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.

Full work available at URL: https://arxiv.org/abs/1206.5629

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

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)

Cites Work

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

Cited In (8)

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

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)