Community detection using boundary nodes in complex networks
arXiv:1802.09618 · doi:10.1016/j.physa.2018.09.044
Abstract
We propose a new local community detection algorithm that finds communities by identifying borderlines between them using boundary nodes. Our method performs label propagation for community detection, where nodes decide their labels based on the largest "benefit score" exhibited by their immediate neighbors as an attractor to their communities. We try different metrics and find that using the number of common neighbors as benefit scores leads to better decisions for community structure. The proposed algorithm has a local approach and focuses only on boundary nodes during iterations of label propagation, which eliminates unnecessary steps and shortens the overall execution time. It preserves small communities as well as big ones and can outperform other algorithms in terms of the quality of the identified communities, especially when the community structure is subtle. The algorithm has a distributed nature and can be used on large networks in a parallel fashion.
10 pages, 10 figures
References in corpus (12)
- Fast unfolding of communities in large networks
- Cooperative Game Theory Approaches for Network Partitioning
- 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
- Structure and tie strengths in mobile communication networks
- Finding statistically significant communities in networks
- An information-theoretic framework for resolving community structure in complex networks
- The ground truth about metadata and community detection in networks
- The many facets of community detection in complex networks
- Community detection using preference networks