Surprise maximization reveals the community structure of complex networks

Abstract

How to determine the community structure of complex networks is an open question. It is critical to establish the best strategies for community detection in networks of unknown structure. Here, using standard synthetic benchmarks, we show that none of the algorithms hitherto developed for community structure characterization perform optimally. Significantly, evaluating the results according to their modularity, the most popular measure of the quality of a partition, systematically provides mistaken solutions. However, a novel quality function, called Surprise, can be used to elucidate which is the optimal division into communities. Consequently, we show that the best strategy to find the community structure of all the networks examined involves choosing among the solutions provided by multiple algorithms the one with the highest Surprise value. We conclude that Surprise maximization precisely reveals the community structure of complex networks.

8 pages, 6 figures, 2 extra tables. Accepted for publication in Scientific Reports

References in corpus (12)

• Fast unfolding of communities in large networks
• Maps of random walks on complex networks reveal community structure
• Near linear time algorithm to detect community structures in large-scale networks
• Benchmark graphs for testing community detection algorithms
• Resolution limit in community detection
• Comparing community structure identification
• Statistical Mechanics of Community Detection
• Narrow scope for resolution-limit-free community detection
• Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement
• Qualitative Comparison of Community Detection Algorithms
• Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering
• Closed benchmarks for network community structure characterization