Gromov–Hausdorff–Prokhorov convergence of vertex cut-trees of n-leaf Galton–Watson trees
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 v...
Autors principals: | He, H, Winkel, M |
---|---|
Format: | Journal article |
Publicat: |
Bernoulli Society for Mathematical Statistics and Probability
2019
|
Ítems similars
-
Minimax functions on Galton-Watson trees
per: Martin, J, et al.
Publicat: (2019) -
Probability theory on Galton-Watson trees
per: Perlin, Alex, 1974-
Publicat: (2005) -
Leaf multiplicity in a Bienaym\'e-Galton-Watson tree
per: Anna M. Brandenberger, et al.
Publicat: (2022-03-01) -
The phase transition for parking on Galton--Watson trees
per: Nicolas Curien, et al.
Publicat: (2022-03-01) -
The Width of Galton-Watson Trees Conditioned by the Size
per: Michael Drmota, et al.
Publicat: (2004-01-01)