Minimal inversion of a permuton sample

Benoît Corsini

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