OxTalks will soon move to the new Halo platform and will become 'Oxford Events.' There will be a need for an OxTalks freeze. This was previously planned for Friday 14th November – a new date will be shared as soon as it is available (full details will be available on the Staff Gateway).
In the meantime, the OxTalks site will remain active and events will continue to be published.
If staff have any questions about the Oxford Events launch, 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.
