# Random Recursive Trees and the Bolthausen-Sznitman Coalesent

@article{Goldschmidt2005RandomRT,
title={Random Recursive Trees and the Bolthausen-Sznitman Coalesent},
author={Christina Goldschmidt and James B. Martin},
journal={Electronic Journal of Probability},
year={2005},
volume={10},
pages={718-745}
}
• Published 13 February 2005
• Mathematics
• Electronic Journal of Probability
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 coalescent restricted to $[n]$: we show that the distribution of the number of blocks involved in the final collision converges as $n\to\infty$, and obtain a scaling law for the sizes of these blocks. We also consider the discrete-time Markov chain giving the number of blocks after each collision…
103 Citations

## Figures from this paper

### A spectral decomposition for the block counting process of the Bolthausen-Sznitman coalescent

• Mathematics
• 2014
A spectral decomposition for the generator and the transition probabilities of the block counting process of the Bolthausen-Sznitman coalescent is derived. This decomposition is closely related to

### -coalescents and stable Galton-Watson trees

• Mathematics
• 2013
. 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 /

### ASYMPTOTIC RESULTS ABOUT THE TOTAL BRANCH LENGTH OF THE BOLTHAU-SEN-SZNITMAN COALESCENT

• Mathematics
• 2006
Abstract We study the total branch length Ln of the Bolthausen-Sznitman coalescent as the sample size n tends to infinity. Asymptotic expansions for the moments of Ln are presented. It is shown that

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

• Mathematics
• 2013
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

### 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

### 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

### Asymptotics of the allele frequency spectrum associated with the Bolthausen-Sznitman coalescent

• Mathematics
• 2007
This paper proves the law of large numbers-type results for the allele frequency spectrum when the coalescent process is taken to be the Bolthausen-Sznitman coalescent and shows that $n^{-1}(\log n) N_1(n) {\stackrel{p}{\rightarrow}} \rho$ as $n \to \infty$.

### Tree lengths for general $\Lambda$-coalescents and the asymptotic site frequency spectrum around the Bolthausen–Sznitman coalescent

• Mathematics
The Annals of Applied Probability
• 2019
We study tree lengths in $\Lambda$-coalescents without a dust component from a sample of $n$ individuals. For the total lengths of all branches and the total lengths of all external branches we

### On Asymptotics of the Beta Coalescents

• Mathematics
• 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

## References

SHOWING 1-10 OF 39 REFERENCES

### 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

### Non-crossing trees revisited: cutting down and spanning subtrees

Two parameters for random non-crossing trees are considered: the number of random cuts to destroy a size-$n$ non-Crossing tree and the spanning subtree-size of randomly chosen nodes in a size-n non- crossing tree, and limiting distributions are obtained.

### The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator

• Mathematics
• 1997
The two-parameter Poisson-Dirichlet distribution, denoted PD(α,θ), is a probability distribution on the set of decreasing positive sequences with sum 1. The usual Poisson-Dirichlet distribution with

### Destruction of Very Simple Trees

• Mathematics
Algorithmica
• 2006
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); these form a

### Destruction of Recursive Trees

For toll functions t n = n а withа ≥0 the totalcosts obtained by completely destroying random recursive trees, the sum of the tolls of every step is computed, to compute for this quantity the asymptotic behaviour of all moments.

### The general coalescent with asynchronous mergers of ancestral lines

• S. Sagitov
• Mathematics
Journal of Applied Probability
• 1999
Take a sample of individuals in the fixed-size population model with exchangeable family sizes. Follow the ancestral lines for the sampled individuals backwards in time to observe the ancestral

### Large deviation principles for some random combinatorial structures in population genetics and Brownian motion

• Mathematics
• 1998
Large deviation principles are established for some random combinatorial structures including the Ewens sampling formula and the Pitman sampling formula. A path-level large deviation principle is

### A NECESSARY AND SUFFICIENT CONDITION FOR THE Λ-COALESCENT TO COME DOWN FROM INFINITY

Let Λ be a finite measure on the Borel subsets of [0, 1]. Let Π∞ be the standard Λ-coalescent, which is defined in [4] and also studied in [5]. Then Π∞ is a Markov process whose state space is the

### Logarithmic Combinatorial Structures: A Probabilistic Approach

• Mathematics
• 2003
The elements of many classical combinatorial structures can be naturally decomposed into components. Permutations can be decomposed into cycles, polynomials over a finite field into irreducible