1 citations · 1 across the 6 of their papers we have counts for
9 papers
Minimal inversion of a permuton sample
Benoît Corsini
Given a permutation , its corresponding \textit{inversion graph} is obtained by adding an edge between if and only if . The first results on random inversion gr…
On exponentially height-penalized random trees
Louigi Addario-Berry, Benoît Corsini, Neeladri Maitra +1
Given and , a $\textit{$μn$}$ is a random plane tree with vertices with law given by $…
Local limit of Prim's algorithm
Benoît Corsini, Rowel Gündlach, Remco van der Hofstad
We study the local evolution of Prim's algorithm on large finite weighted graphs. When performed for steps, where is the size of the graph, Prim's algorithm will construct…
Binary search trees of permuton samples
Benoît Corsini, Victor Dubach, Valentin Féray
Binary search trees (BST) are a popular type of data structure when dealing with ordered data. Indeed, they enable one to access and modify data efficiently, with their height corr…
Limits of Mallows trees
Benoît Corsini
This article studies the limit of binary search trees drawn from Mallows permutations under various topologies. The main result, pertaining to the standard local topology for graph…
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…
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…
The height of record-biased trees
Benoît Corsini
Given a permutation , its corresponding binary search tree is obtained by recursively inserting the values into a binary tree so that the label of each node i…
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…