On 28th November OxTalks will move to the new Halo platform and will become 'Oxford Events' (full details are available on the Staff Gateway).
There will be an OxTalks freeze beginning on Friday 14th November. This means you will need to publish any of your known events to OxTalks by then as there will be no facility to publish or edit events in that fortnight. During the freeze, all events will be migrated to the new Oxford Events site. It will still be possible to view events on OxTalks during this time.
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.
