Random trees conditioned on the number of vertices and leaves

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

• Slava Kargin (Binghampton)
• Tuesday 21 February 2023, 15:30-16:30
• MR12, Centre for Mathematical Sciences.

If you have a question about this talk, please contact Perla Sousi.

I will talk about Galton-Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$. Both $k$ and $n$ are assumed to grow to infinity and $k = \alpha n + O(1)$, with $\alpha \in (0, 1)$. Assuming the exponential decay of the offspring distribution, I show that the rescaled random tree converges in distribution to Aldous’ Continuum Random Tree with respect to the Gromov-Hausdorff topology. The rescaling depends on a parameter $\sigma^2$ which can be calculated explicitly. Additionally, I will describe the limit of the degree sequence for the conditioned trees.

This talk is part of the Probability series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12, Centre for Mathematical Sciences
• Probability
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.