Tolerating the Community Detection Resolution Limit with Edge Weighting
Jonathan W. Berry, Bruce Hendrickson, Randall A. LaViolette, Cynthia, A. Phillips

TL;DR
This paper addresses the resolution limit problem in community detection by extending modularity to weighted networks, proposing a method to improve detection accuracy of small communities through edge weighting and algorithm modification.
Contribution
It introduces a novel approach to mitigate the resolution limit in community detection by deriving new edge weights and adapting the CNM algorithm for weighted modularity maximization.
Findings
Weighted modularity can resolve smaller communities when inter-community edge weights are minimized.
Modified CNM algorithm achieves accuracy comparable to state-of-the-art methods.
Experimental results show significant improvement over traditional modularity-based detection.
Abstract
Communities of vertices within a giant network such as the World-Wide Web are likely to be vastly smaller than the network itself. However, Fortunato and Barth\'{e}lemy have proved that modularity maximization algorithms for community detection may fail to resolve communities with fewer than edges, where is the number of edges in the entire network. This resolution limit leads modularity maximization algorithms to have notoriously poor accuracy on many real networks. Fortunato and Barth\'{e}lemy's argument can be extended to networks with weighted edges as well, and we derive this corollary argument. We conclude that weighted modularity algorithms may fail to resolve communities with fewer than total edge weight, where is the total edge weight in the network and is the maximum weight of an inter-community edge. If is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
