Long range community detection

Abstract : 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.
Document type :
Conference papers
LAWDN - Latin-American Workshop on Dynamic Networks, Nov 2010, Buenos Aires, Argentina. 4 p


https://hal.inria.fr/inria-00531750
Contributor : Thomas Aynaud <>
Submitted on : Wednesday, November 3, 2010 - 4:34:27 PM
Last modification on : Thursday, November 4, 2010 - 1:44:43 PM

File

lawdn2010_submission_5.pdf
fileSource_public_author

Identifiers

  • HAL Id : inria-00531750, version 1

Collections

Citation

Thomas Aynaud, Jean-Loup Guillaume. Long range community detection. LAWDN - Latin-American Workshop on Dynamic Networks, Nov 2010, Buenos Aires, Argentina. 4 p. <inria-00531750>

Export

Share

Metrics

Consultation de
la notice

160

Téléchargement du document

43