Journal
NEW JOURNAL OF PHYSICS
Volume 9, Issue -, Pages -Publisher
IOP Publishing Ltd
DOI: 10.1088/1367-2630/9/6/176
Keywords
-
Categories
Ask authors/readers for more resources
The ubiquity of modular structure in real-world complex networks is the focus of attention in many trials to understand the interplay between network topology and functionality. The best approaches to the identification of modular structure are based on the optimization of a quality function known as modularity. However this optimization is a hard task provided that the computational complexity of the problem is in the non-deterministic polynomial-time hard (NP-hard) class. Here we propose an exact method for reducing the size of weighted (directed and undirected) complex networks while maintaining their modularity. This size reduction allows use of heuristic algorithms that optimize modularity for a better exploration of the modularity landscape. We compare the modularity obtained in several real complex-networks by using the extremal optimization algorithm, before and after the size reduction, showing the improvement obtained. We speculate that the proposed analytical size reduction could be extended to an exact coarse graining of the network in the scope of real-space renormalization.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available