BAUDIN Alexis
Supervision : Clémence MAGNIEN, Lionel TABOURIER
Static and temporal cliques: enumeration and community detection algorithms
Graphs are mathematical structures that model various connections between entities of different natures, such as the links between users on social networks, the interconnected stations in a transport network like the metro, or the billions of neurons interacting in a brain. In recent years, the dynamic nature of these networks has become widely recognized, underlining the importance of considering their temporal evolution in order to understand their functioning.
My PhD aims to better understand how real-world massive graphs are structured, and to develop tools to extend our understanding to time-evolving networks. It focuses on cliques, which are groups of elements all connected to each other. We explore their enumeration in both static and temporal graphs, as well as their utility in community detection. The communities of a graph group together vertices that interact strongly with each other, yet have few links with the rest of the graph. Studying them helps to understand the structural and functional properties of networks.
Defence : 12/14/2023
Jury members :
Arnaud Casteigts, Professeur des universités, Université de Genève [Rapporteur]
Vincent Labatut, Maître de conférences, Laboratoire d’Informatique d’Avignon [Rapporteur]
Alix Munier, Professeure des universités, Sorbonne Université, CNRS, LIP6
Christian Vestergaard, Chargé de recherche, Institut Pasteur
Clémence Magnien, Directrice de recherche, Sorbonne Université, CNRS, LIP6
Lionel Tabourier, Maître de conférences, Sorbonne Université, CNRS, LIP6
2021-2024 Publications
-
2024
- A. Baudin, C. Magnien, L. Tabourier : “Faster maximal clique enumeration in large real-world link streams”, Journal of Graph Algorithms and Applications, vol. 28 (1), pp. 149-178, (Brown University) (2024)
-
2023
- A. Baudin : “Cliques statiques et temporelles : algorithmes d’énumération et de détection de communautés”, thesis, phd defence 12/14/2023, supervision Magnien, Clémence Tabourier, Lionel (2023)
- A. Baudin, L. Tabourier, C. Magnien : “LSCPM: communities in massive real-world Link Streams by Clique Percolation Method”, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023), vol. 278, Leibniz International Proceedings in Informatics (LIPIcs), Athens, Greece (2023)
- A. Baudin, C. Magnien, L. Tabourier : “Énumération efficace des cliques maximales dans les flots de liens réels massifs”, Extraction et Gestion des Connaissances (EGC 2023), vol. RNTI-E-39, Revue des Nouvelles Technologies de l'Information, Lyon, France, pp. 139-150 (2023)
-
2022
- A. Baudin, M. Danisch, S. Kirgizov, C. Magnien, M. Ghanem : “Clique percolation method: memory efficient almost exact communities”, The 17th International Conference on Advanced Data Mining and Applications (ADMA), Syndey, Australia (2022)
-
2021
- D. Zea, S. Laskina, A. Baudin, H. Richard, E. Laine : “Assessing Conservation of Alternative Splicing with Evolutionary Splicing Graphs”, Genome Research, (Cold Spring Harbor Laboratory Press) (2021)