Francis Durand
PhD student in combinatorics · LAGA, Université Sorbonne Paris Nord · advised by Olivier Bodini
About
I am a third-year PhD student in mathematics and theoretical computer science (2024–2027). I work on the exact uniform random generation of combinatorial structures, at the interface between analytic combinatorics, probability and algorithms.
My main goal is to sample large structures in a quasi-entropic way: using a number of random bits as close as possible to the information-theoretic minimum given by Shannon's entropy, while keeping an optimal running time. Recent work covers set partitions and their generalisations (Dobiński structures), increasing trees, simply generated trees and binary words with a fixed number of ones.
- Random generation
- Random-bit complexity
- Analytic combinatorics
- Generating functions & symbolic methods
- Probabilistic combinatorics
- Repeated grafting & normal ordering
Publications
- JournalDobiński Structures and Samplersto appear
- AofA 2026Efficient Sampling of Increasing Trees
- AofA 2026Asymptotic Analysis of Generating Functions Arising from Dynamic Graphs
- GASCom 2026Entropic Generation of Binary Words
- IWOCA 2025Optimal Random Bit Complexity in Efficient Sampling of Set Partition-Like Structures
- GASCom 2024Optimal Generation of Strictly Increasing Binary Trees and Beyond
Operations research
- ICSP 2025Relative Value Iteration for Infinite-Horizon SDDP: Application to Hydroelectric Problem
Talks & Presentations
- 2026Journées Montoises 2026, NaplesEntropic exact-size tree sampling via a continuous relaxation of the degree profile distribution
- 2026ANR–FWF PAnDAG project meetingEntropic generation of binary words
- 2026GASCom 2026Entropic Generation of Binary Words
- Jun 2026AofA 2026, MunichEfficient Sampling of Increasing Trees
- Mar 2026Aléa days, CIRMEfficient Sampling of Increasing Trees
- Jul 2025IWOCA 2025, BozemanOptimal Random Bit Complexity in Efficient Sampling of Set Partition-Like Structures
- 2025EUROComb 2025 — posterEfficient Random-Bit Algorithms for Uniform Involutions · Poster
- 2025ICECA 2025A random sampler for rook placements in Ferrers boards · Video
- 2025ICSP 2025Relative Value Iteration for Infinite-Horizon SDDP: Application to Hydroelectric Problem
- Feb 2025ROADEF 2025, ENPCFinalist of the “Prix du mémoire de Master RO/AD” (best Master's thesis in Operations Research)
- Nov 2024PGMO Days 2024, EDFRelative Value Iteration for Infinite-Horizon SDDP: Application to Hydroelectric Problem
- Jun 2024GASCom 2024, BordeauxOptimal Generation of Strictly Increasing Binary Trees and Beyond
- —Séminaire CALIN, LIPNIterated grafting operators and preferential attachment graph models · Abstract
Teaching & Supervision
- Architecture des ordinateurs — L2 Informatique, Université Sorbonne Paris Nord. Basics of assembly, based on Olivier Carton's course.
- Supervised two high-school students for a two-week internship in combinatorics (spring 2025).
Funding
My research is supported by the ANR–FWF project PAnDAG (ANR-23-CE48-0014).
Friends & Colleagues
- Olivier Bodini — my advisor
- Cyril Pujol
- Étienne Objois