The vertex-cut-tree of Galton-Watson trees converging to a stable tree
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 . Our main result is that, for a sequence of such trees conditioned to have size , the corresponding rescaled cut-trees converge in distribution to the stable tree of index , 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.
Keywords
Cite
@article{arxiv.1312.5525,
title = {The vertex-cut-tree of Galton-Watson trees converging to a stable tree},
author = {Daphné Dieuleveut},
journal= {arXiv preprint arXiv:1312.5525},
year = {2016}
}
Comments
Published at http://dx.doi.org/10.1214/14-AAP1047 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)