Gromov–Hausdorff–Prokhorov convergence of vertex cut-trees of n-leaf Galton–Watson trees

Journal article

In this paper, we study the vertex cut-trees of Galton–Watson trees conditioned to have n leaves. This notion is a slight variation of Dieuleveut’s vertex cut-tree of Galton–Watson trees conditioned to have n vertices. Our main result is a joint Gromov–Hausdorff–Prokhorov convergence in the finite variance case of the Galton–Watson tree and its vertex cut-tree to Bertoin and Miermont’s joint distribution of the Brownian CRT and its cut-tree. The methods also apply to the infinite variance case, but the problem to strengthen Dieuleveut’s and Bertoin and Miermont’s Gromov–Prokhorov convergence to Gromov–Hausdorff–Prokhorov remains open for their models conditioned to have n vertices.

Authors: He, H; Winkel, M

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Bernoulli Society for Mathematical Statistics and Probability
• Journal: Bernoulli
• Volume: 25
• Issue: 3
• Pages: 2301-2329
• Publication date: 2019-06-12
• Acceptance date: 2018-06-24
• DOI: 10.3150/18-BEJ1055
• EISSN: 1573-9759
• ISSN: 1350-7265
• Keywords: Galton–Watson tree; Gromov–Hausdorff–Prokhorov topology; cut-tree; stable tree; R-tree; Continuum Random Tree; Invariance Principle; fragmentation at nodes