Long range community detection - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Long range community detection

Thomas Aynaud
  • Function : Author
  • PersonId : 881439
Jean-Loup Guillaume


Complex networks can usually be divided in dense subnetworks called communities. In evolving networks, the usual way to detect communities is to find several partitions independently, one for each time step. However, this generally causes troubles when trying to track communities from one time step to the next. We propose here a new method to detect only one decomposition in communities that is good for (almost) every time step. We show that this unique partition can be computed with a modification of the Louvain method and that the loss of quality at each time step is generally low despite the constraint of global maximization. We also show that some specific modifications of the networks topology can be identified using this unique partition in the case of the Internet topology.
Fichier principal
Vignette du fichier
lawdn2010_submission_5.pdf (113.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00531750 , version 1 (03-11-2010)


  • HAL Id : inria-00531750 , version 1


Thomas Aynaud, Jean-Loup Guillaume. Long range community detection. LAWDN - Latin-American Workshop on Dynamic Networks, INTECIN - Facultad de Ingeniería (U.B.A.) - I.T.B.A., Nov 2010, Buenos Aires, Argentina. 4 p. ⟨inria-00531750⟩
335 View
190 Download


Gmail Facebook X LinkedIn More