pith. sign in

arxiv: 1312.5525 · v2 · pith:AH654KD7new · submitted 2013-12-19 · 🧮 math.PR

The vertex-cut-tree of Galton-Watson trees converging to a stable tree

classification 🧮 math.PR
keywords treesgalton-watsonstablealphadistributionindexresulttree
0
0 comments X
read the original abstract

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 genealogy of the nested connected components created by this process. We essentially work in the setting of Galton-Watson trees with offspring distribution belonging to the domain of attraction of a stable law of index $\alpha\in(1,2)$. Our main result is that, for a sequence of such trees $\mathcal{T}_n$ conditioned to have size $n$, the corresponding rescaled cut-trees converge in distribution to the stable tree of index $\alpha$, in the sense induced by the Gromov-Prokhorov topology. This gives an analogue of a result obtained by Bertoin and Miermont in the case of Galton-Watson trees with finite variance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.