Thomas Aynaud

e-mail : taynaud [ A T ] gmail [ D O T ] com

I have done a phd in the team Complex Networks at LIP6. My advisors were Jean-Loup Guillaume and Matthieu Latapy. My thesis was dealing with the study and the detection of dynamic communities in networks (social networks, computer networks, web...).

You can find my thesis on this link (in french)

Here is my resume.

Research

Publications

• Détection de communautés dans les réseaux dynamiques: Applications de la méthode de Louvain aux graphes dynamiques, Thomas Aynaud, Jean-Loup Guillaume.
• Multilevel Local Optimization of Modularity, Thomas Aynaud, Vincent D. Blondel, Jean-Loup Guillaume and Renaud Lambiotte, in Graph Partitioning
• Communities in Evolving Networks: Definitions, Detection, and Analysis Techniques, Thomas Aynaud, Eric Fleury, Jean-Loup Guillaume, Qinna Wang, in Dynamics On and Of Complex Networks, Volume 2
• Extraction hiérarchique de fenêtres de temps basée sur la structure communautaire, Thomas Aynaud and Jean-Loup Guillaume, in Proceedings of MARAMI 2011.
• Multi-Step Community Detection and Hierarchical Time Segmentation in Evolving Networks, Thomas Aynaud and Jean-Loup Guillaume, in Proceedings of the 5th SNA-KDD Workshop '11.
• Long range community detection, Thomas Aynaud and Jean-Loup Guillaume, in Proceedings of Latin American Workshop on Dynamic Networks 2010.
• Détection de communautés à long terme dans les graphes dynamiques, Thomas Aynaud and Jean-Loup Guillaume, in Proceedings of Journée thématique : Fouille de grands graphes .
• Optimisation locale multi-niveaux de la modularité, Thomas Aynaud, Vincent Blondel, Jean-Loup Guillaume and Renaud Lambiotte, in Partitionnement de graphe : optimisation et applications, Traité IC2, Hermes-Lavoisier 2011
• Static community detection algorithms for evolving networks, Thomas Aynaud and Jean-Loup Guillaume, Proceedings of International Workshop on Dynamic Networks (WDN), in conjunction with WiOpt 2010, pages 508-514.
• Structure multi-échelle de grands graphes de terrain, Thomas Aynaud and Jean-Loup Guillaume, to appear in Technique et science informatiques

Plots

Each week, some members of the team draw a cool graph (a plot) and publish it with some explanations. I have participated to the followings:

• Dynamics and stability of communities
• Maximizing the modularity: what is left behind
• Size distribution of communities at different scales

Internships

• 2008 : Internship at the LIP6 : Structure multi-échelle des grands graphes (report, slides).
• 2007 : Internship at the Vrije Universiteit (Amsterdam) with Guillaume Pierre and Paolo Costa : (report in english, with a short introduction in french).

Softwares

• An implementation of the louvain method in python with the networkx library. The documentation is here, the software is hosted on bitbucket.
• An implementation of the multi-step community detection algorithm is on my advisor webpage.
• A console for Gephi that allows to script it using python. See this wiki page.

Teaching

• 2009 : TD Maple en MPSI au lycée Lakanal.
  • TD12 : transformations (sujet, correction)
• 2008-2009 : TD Maple en PC au lycée Lavoisier.
  • TD1 : reprise en main (sujet)
  • TD2 : initiation aux structures utiles en programmation (sujet)
  • TD3 : listes et graphisme (sujet)
  • TD4 : dessin de suites et équations différentielles (sujet)
  • TD5 : calcul et équations différentielles (sujet)

Last update : 10th, February 2022