The Power of Consensus: Random Graphs Have No Communities

Jean-Loup Guillaume 1 Romain Campigotto 1 Massoud Seifi
1 ComplexNetworks
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Communities are a powerful tool to describe the structure of complex networks. Algorithms aiming at maximizing a quality function called modularity have been shown to effectively compute the community structure. However, some problems remain: in particular, it is possible to find high modularity partitions in graph without any community structure, in particular random graphs. In this paper, we study the notion of consensual communities and show that they do not exist in random graphs. For that, we exhibit a phase transition based on the strength of consensus: below a given threshold, all the nodes belongs to the same consensual community; above this threshold, each node is in its own consensual community.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01217386
Contributor : Lip6 Publications <>
Submitted on : Monday, October 19, 2015 - 3:08:29 PM
Last modification on : Thursday, March 21, 2019 - 2:32:46 PM

Identifiers

  • HAL Id : hal-01217386, version 1

Citation

Jean-Loup Guillaume, Romain Campigotto, Massoud Seifi. The Power of Consensus: Random Graphs Have No Communities. IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, Aug 2013, Niagara Falls, ON, Canada. IEEE, pp.272-276. 〈hal-01217386〉

Share

Metrics

Record views

88