Static community detection algorithms for evolving networks

Thomas Aynaud 1 Jean-Loup Guillaume 1
1 ComplexNetworks
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00492058
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, June 15, 2010 - 12:32:10 AM
Last modification on : Thursday, March 21, 2019 - 2:43:12 PM
Long-term archiving on : Wednesday, September 15, 2010 - 8:26:16 PM

File

p508-aynaud.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00492058, version 1

Citation

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⟩

Share

Metrics

Record views

508

Files downloads

2093