University of Cambridge > Talks.cam > Probability > Random trees conditioned on the number of vertices and leaves

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Random trees conditioned on the number of vertices and leaves

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Statistics of Prof Philip Dawid level 7 seminar room, Cambridge Insititute for Medical Research St Pauls Church, Hills Road

Other talks

Tissue-scale communication in cancer development CUSCRS and Renal Medicine The Importance of Teaching about Science and Religion in a Time of Global Uncertainty Group Work TBC Alicia Anderson discussing some exciting news about HARPS3
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity