Benoît Corsini

collaborators

4 papers

math.PR2026

Minimal inversion of a permuton sample

BenoÃ®t Corsini

Given a permutation $I ¨ $ , its corresponding \textit{inversion graph} is obtained by adding an edge between $i < j$ if and only if $I ¨ (i) > I ¨ (j)$ . The first results on random inversion…

math.PR2025

On exponentially height-penalized random trees

Louigi Addario-Berry, BenoÃ®t Corsini, Neeladri Maitra +1

Given $n \in N$ and $I^¼ \in R$ , a $\textit{$Î¼ $- h e i g h t - bia se d t r eeo f s i z e$ n$}$ is a random plane tree $T_{n}$ with $n$ vertices with law given by…

math.PR2025

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 $n$ steps, where $n$ is the size of the graph, Prim's algorithm will construct…

math.PR2025

Binary search trees of permuton samples

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…