- Random graphs
- Permutations
- Scaling limits
- +۳ مورد دیگر
Lucas Gerin is a Lecturer-researcher at the École Polytechnique's CMAP Probability Department. His roles include co-heading the Probability Department and supervising PhD students such as Théo Lenoir and Maxime Marivain. His research focuses on random graphs, permutations, scaling limits, and probabilistic combinatorial optimization, with notable contributions to permutation patterns and graphon limits. Education: PhD in Applied Mathematics from Université Henri Poincaré (2008), Habilitation to Supervise Research from Université Paris-Sud (2018). Grants: ANR Louccoum (2025-2029). Events: Organized PC Days 2022, designed logo for Permutation Patterns 2019, participated in conferences like European Meeting of Statisticians (2015). Labs/Teams: Active in CMAP research groups focusing on probability and combinatorial structures. Research highlights include work on the Ulam-Hammersley problem, dense graph limits, and longest increasing paths in permutations. His interdisciplinary work bridges probability theory, combinatorics, and statistical physics.









