Mickaël Maazoun — Mathematics
I've left academia for other endeavours but would still enjoy chatting about math-related matters on mickael.lastname at gmail dot com
I've previously worked at Oxford's Department of Statistics in the research group of Prof. Christina Goldschmidt. Before that I was a PhD student in ENS Lyon, under the supervision of Grégory Miermont.
Research
Thesis
My PhD thesis called Permutons limites universels de permutations aléatoires à motifs exclus.
Papers
- [7] A new proof of Cayley's formula.
With Louigi Addario-Berry, Serte Donderwinkel and James Martin.
Preprint (2021) arXiV.
- [6] Linear-sized independent sets in random cographs and increasing subsequences in separable permutations.
With Frédérique Bassino, Mathilde Bouvel, Michael Drmota, Valentin Féray, Lucas Gerin and Adeline Pierrot.
Preprint (2021) arXiV
- [5] Scaling and local limits of Baxter permutations through coalescent-walk processes.
With Jacopo Borga.
Preprint (2020) arXiV.
Presented at AofA 2020, extended abstract in LIPIcs, 159 7:1–7:18. (2020) arXiv - Journal.
- [4] Random cographs: Brownian graphon limit and asymptotic degree distribution.
With Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Adeline Pierrot.
To appear in Random Structures and Algorithms (2021). arXiv Journal.
- [3] Scaling limits of permutation classes with a finite specification: a dichotomy.
With Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Adeline Pierrot.
Preprint (2019) arXiv - companion Sage notebooks.
- [2] On the Brownian separable permuton.
Combinatorics, Probability and Computing 29(2), 241-266 (2020) Journal - PDF - arXiv - HAL.
- [1] Universal limits of substitution-closed permutation classes.
With Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Adeline Pierrot.
Journal of the European Mathematical Society 22(11) 3565–3639 (2020) Journal - arXiv - HAL.
Software
-
Specifier: a Sage module to compute the specification of a permutation class with a finite number of simples using the substitution decomposition, and produce a Boltzmann sampler of the class. It is an implementation of the algorithm of Bassino et. al. (2017)
Talks
Teaching in Lyon