![]() |
![]() |
University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of n-leaf Galton-Watson trees
![]() Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of n-leaf Galton-Watson treesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Guillem Perarnau. 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. This is joint work with Hui He, Beijing Normal University. This talk is part of the Combinatorics and Probability Seminar series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsType the title of a new list here EPS - College Research and KT Support Activities Condensed Matter Group MeetingsOther talksProvably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Ultrafast, all-optical, and highly efficient imaging of molecular chirality Geometry of alternating projections in metric spaces with bounded curvature Sensing and metrology activities at NPL, India Disorder relevance for non-convex random gradient Gibbs measures in d=2 Modelling uncertainty in image analysis. |