University of Cambridge > Talks.cam > Probability > Large degrees yield short trees

  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

Large degrees yield short trees

Download to your calendar using vCal

If you have a question about this talk, please contact Jason Miller .

I will speak about results from an ongoing project with Louigi Addario-Berry. I will present non-asymptotic, universal height bounds for random combinatorial trees. We use these results to obtain new height bounds on conditioned Bienaymé-Galton-Watson trees and simply generated trees. Moreover, I will introduce a stochastic domination result for combinatorial trees that implies that binary trees are stochastically the tallest. These results are based on a new bijection between trees and sequences that was introduced in a joint work with Louigi Addario-Berry, Mickaël Maazoun and James Martin.

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

Microsoft Research, Roger Needham Building, 7 J J Thomson Avenue, Cambridge CB3 0FB Average on weekdays: 8851.025 kWh Room S1 Alison Richard Building, Sidgwick Site, 7 West Rd, CB3 9DT

Other talks

Title to be confirmed Group Presentation 2 Title to be confirmed Group Presentation 1 Online Causal Inference Seminar "Gods, Monsters & Middle-class Uncles: Indian Comics in a Time between Worlds"
 

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