Abstract
We present a fast spectral algorithm for community detection in complex networks. Our method searches for the partition with the maximum value of the modularity via the interplay of several refinement steps that include both agglomeration and division. We validate the accuracy of the algorithm by applying it to several real-world benchmark networks. On all these, our algorithm performs as well or better than any other known polynomial scheme. This allows us to extensively study the modularity distribution in ensembles of Erdős-Rényi networks, producing theoretical predictions for means and variances inclusive of finite-size corrections. Our work provides a way to accurately estimate the effect size of modularity, providing a z-score measure of it and enabling a more informative comparison of networks with different numbers of nodes and links.
| Original language | English |
|---|---|
| Article number | P02003 |
| Journal | Journal of Statistical Mechanics: Theory and Experiment |
| Volume | 2015 |
| DOIs | |
| Publication status | Published - 3 Feb 2015 |
Bibliographical note
Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.Fingerprint Dive into the research topics of 'Fast and accurate determination of modularity and its effect size'. Together they form a unique fingerprint.
Profiles
-
Charo del Genio
- Faculty Research Centre in Fluid and Complex Systems - Assistant Professor (Academic)
Person: Teaching and Research