3 papers
math.PR2022
Finding minimum spanning trees via local improvements
Louigi Addario-Berry, Jordan Barrett, Benoît Corsini
We consider a family of local search algorithms for the minimum-weight spanning tree, indexed by a parameter . One step of the local search corresponds to replacing a connected…
math.PR2022
Continuous-time Mallows processes
Benoît Corsini
In this article, we introduce \textit{Mallows processes}, defined to be continuous-time càdlàg processes with Mallows distributed marginals. We show that such processes exist and t…
math.PR2020
The height of Mallows trees
Louigi Addario-Berry, Benoît Corsini
Random binary search trees are obtained by recursively inserting the elements of a uniformly random permutation of into a binary sea…