University of Birmingham > Talks@bham > Combinatorics 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 trees

Add to your list(s) Download to your calendar using vCal

  • UserMatthias Winkel (University of Oxford)
  • ClockTuesday 03 October 2017, 15:00-16:00
  • HouseWatson LTA.

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 Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.