The skew Brownian permuton: a new universal limit for random constrained permutations

Consider a large random permutation satisfying some constraints or biased according to some statistics. What does it look like? In this seminar we make sense of this question introducing the notion of permuton. Permuton convergence has been established for several models of random permutations in various works: we give an overview of some of these results, mainly focusing on the case of pattern-avoiding permutations.

The main goal of the talk is to present a new family of universal limiting permutons, called skew Brownian permuton. This family includes (as particular cases) some already studied limiting permutons, such as the biased Brownian separable permuton and the Baxter permuton. We also show that some natural families of random constrained permutations converge to some new instances of the skew Brownian permuton.

The construction of these new limiting objects will lead us to investigate an intriguing connection with some perturbed versions of the Tanaka SDE and the SDEs encoding skew Brownian motions. We finally present several open questions on these new fractal random measures.