Static community detection algorithms for evolving networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Static community detection algorithms for evolving networks

Thomas Aynaud
  • Function : Author
Jean-Loup Guillaume

Abstract

Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform their outputs if the input network is slightly modified. The instabilities appear to be important and we propose a modification of one algorithm to stabilize it and to allow the tracking of the communities in an evolving network. This modification has one parameter which is a tradeoff between stability and quality. The resulting algorithm appears to be very effective. We finally use it on an evolving network of blogs.
Fichier principal
Vignette du fichier
p508-aynaud.pdf (393.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00492058 , version 1 (15-06-2010)

Identifiers

  • HAL Id : inria-00492058 , version 1

Cite

Thomas Aynaud, Jean-Loup Guillaume. Static community detection algorithms for evolving networks. WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.508-514. ⟨inria-00492058⟩
484 View
2374 Download

Share

Gmail Facebook X LinkedIn More