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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Large degrees yield short trees

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Academy of Ancient Music arts fundraising workshops at the Judge Business School WLC - 17 May Behind the Scenes of China's Cross Border Mergers & Acquisitions Theory of Condensed Matter

Other talks

Endogenous Pararetroviruses Regulate Gene Expression in Hybrids Toward Broad and Deep Language Understanding for Intelligent Systems Using the marmoset prefontal cortex to understand psychiatric symptoms: schizophrenia and hippocampal-prefrontal circuitry From reindeer antlers to tea light candles: Multiple users at the Sámi offering places Are confluent cell layers extensile or contractile? Merger-induced galaxy transformations in the ARTEMIS simulations
 

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