OxTalks will soon be transitioning to Oxford Events (full details are available on the Staff Gateway). A two-week publishing freeze is expected in early Hilary to allow all events to be migrated to the new platform. During this period, you will not be able to submit or edit events on OxTalks. The exact freeze dates will be confirmed as soon as possible.
If you have any questions, please contact halo@digital.ox.ac.uk
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 show height bounds on conditioned Bienaymé trees and simply generated trees. Moreover, I will introduce a stochastic domination result for combinatorial trees, implying that binary trees are stochastically the tallest. These results are based on a new bijection between trees and sequences that got introduced in a joint work with Louigi Addario-Berry, Mickaël Maazoun and James Martin.
