Please Note: This seminar will be given online.
Probability seminar series
Link to join seminar: Hosted on Webex
The height of Mallows trees
Mallows trees are the search trees corresponding to Mallows permutations. Mallows permutations are a parameterized family of random permutations interpolating between the uniformly random permutation and the identity permutation. The corresponding search trees interpolate between random binary search trees and paths. I'll present what we know about the height and structure of such trees, as well as future research possibilities on the subject.
The talk is based on joint work with my doctoral student, Benoît Corsini.