Robustness modularity in complex networks

Filipi N. Silva, Aiiad Albeshri, Vijey Thayananthan, Wadee Alhalabi, Santo Fortunato

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)
6 Downloads (Pure)

Abstract

A basic question in network community detection is how modular a given network is. This is usually addressed by evaluating the quality of partitions detected in the network. The Girvan-Newman (GN) modularity function is the standard way to make this assessment, but it has a number of drawbacks. Most importantly, it is not clearly interpretable, given that the measure can take relatively large values on partitions of random networks without communities. Here we propose a measure based on the concept of robustness: modularity is the probability to find trivial partitions when the structure of the network is randomly perturbed. This concept can be implemented for any clustering algorithm capable of telling when a group structure is absent. Tests on artificial and real graphs reveal that robustness modularity can be used to assess and compare the strength of the community structure of different networks. We also introduce two other quality functions: modularity difference, a suitably normalized version of the GN modularity, and information modularity, a measure of distance based on information compression. Both measures are strongly correlated with robustness modularity, but have lower time complexity, so they could be used on networks whose size makes the calculation of robustness modularity too costly.

Original languageEnglish
Article number054308
JournalPhysical Review E
Volume105
Issue number5
DOIs
Publication statusPublished - 13 May 2022
Externally publishedYes

Fingerprint

Dive into the research topics of 'Robustness modularity in complex networks'. Together they form a unique fingerprint.

Cite this