Francis Durand
I'm a first-year PhD student in mathematics and theoretical computer science, working on combinatorics.
I’m particularly interested in random generation, symbolic methods, and the interface between combinatorics and probability.
In particular, I work on generating structures in a quasi-entropic manner, that is, with a consumption in random bits close to the theoretical minimum amout, given by the Shannon's information limit.
Research Interests
- Random generation of combinatorial structures
- Symbolic combinatorics and generating functions
- Probabilistic combinatorics
Publications
-
Optimal Random Bit Complexity in Efficient Sampling of Set Partition-Like Structures
with Olivier Bodini 2025.
[link]
-
Optimal Generation of Strictly Increasing Binary Trees and Beyond
with Olivier Bodini, and Philippe Marchal 2024.
[arXiv] [DOI]
Talks & Presentations
- Séminaire CALIN du LIPN – Iterated grafting operators and preferential attachment graph models [Link]
- EUROComb 2025 – Poster Presentation: Efficient Random-Bit Algorithms for Uniform Involutions [Poster]
- ICECA 2025 – A random sampler for rook placements in Ferrers board [Youtube]
- ICSP 2025 – Relative Value Iteration for Infinite-Horizon SDDP: Application to Hydroelectric Problem
- IWOCA 2025 – Optimal Random Bit Complexity in Efficient Sampling of Set Partition-Like Structures
- ROADEF 2025 (ENPC, February 2025) – Finalist of the "Prix du mémoire de Master RO/AD", the ROADEF award for best Operation Research Masters
- PGMO 2024 (EDF, November 2024) – Relative Value Iteration for Infinite-Horizon SDDP:
Application to Hydroelectric Problem
- GASCom 2024 (Bordeaux, June 2024) – Optimal Generation of Strictly Increasing Binary Trees and Beyond
Teaching & Supervision
Friends & Colleagues