Stable community cores in complex networks

Massoud Seifi 1 Jean-Loup Guillaume 1 Ivan Junier Jean-Baptiste Rouquier Svilen Iskrov
1 ComplexNetworks
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Complex networks are generally composed of dense sub-networks called communities. Many algorithms have been proposed to automatically detect such communities. However, they are often unstable and behave nondeterministically. We propose here to use this non-determinism in order to compute groups of nodes on which community detection algorithms agree most of the time.We show that these groups of nodes, called community cores, are more similar to Ground Truth than communities in real and artificial networks. Furthermore, we show that in contrary to the classical approaches, we can reveal the absence of community structure in random graphs.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Lip6 Publications <>
Submitted on : Thursday, February 11, 2016 - 5:25:00 PM
Last modification on : Thursday, March 21, 2019 - 12:59:40 PM

Links full text



Massoud Seifi, Jean-Loup Guillaume, Ivan Junier, Jean-Baptiste Rouquier, Svilen Iskrov. Stable community cores in complex networks. 3rd Workshop on Complex Networks (CompleNet 2012), Mar 2012, Melbourne, Florida, United States. 3rd Workshop on Complex Networks (CompleNet 2012), 424, pp.87-98, Studies in Computational Intelligence. 〈10.1007/978-3-642-30287-9_10〉. 〈hal-01273060〉



Record views