I am a PhD student in complex networks in Paris. I graduated from ENS Lyon in computer sciences and my main research interests are graph theory, complex systems and data analysis.
The PhD project began in September 2020 at LIP6 Sorbonne and CRI Paris under the supervision of Lionel Tabourier and Clémence Magnien. It focusses on sorting nodes to scale to massive real-world networks: as we have access to arbitrarily big networks collected from various fields (biology, social ties, trade, web), graph algorithms can only scale if they have linear complexity. One promising idea is to sort nodes according to specific graph properties (degree, centrality, degeneracy…) to improve experimental run-time and theoretical bounds.
Feel free to contact me by email!
Fabrice Lécuyer, Maximilien Danisch, Lionel Tabourier. [Replication] Speedup Graph Processing by Graph Ordering (ReScience, 2021) [DOI]
Fabrice Lécuyer, Rémy Cazabet. Community detection in fine-grained dynamical networks (Internship in Lyon, 2020) [report]
Fabrice Lécuyer, Marc Santolini, Amar Dhand, Sean Cornelius, Albert-László Barabási. Model of the Hospital Network and Health Trajectories (Internship in Boston, 2017) [report]
Fabrice Lécuyer, Olivier Roux. Introduction de données quantitatives dans la modélisation qualitative des régulations biologiques (Internship in Nantes, 2016) [report]