Network Community Detection on Metric Space
arXiv:1508.06380 · doi:10.3390/a8030680
Abstract
Community detection in a complex network is an important problem of much interest in recent years. In general, a community detection algorithm chooses an objective function and captures the communities of the network by optimizing the objective function, and then, one uses various heuristics to solve the optimization problem to extract the interesting communities for the user. In this article, we demonstrate the procedure to transform a graph into points of a metric space and develop the methods of community detection with the help of a metric defined for a pair of points. We have also studied and analyzed the community structure of the network therein. The results obtained with our approach are very competitive with most of the well-known algorithms in the literature, and this is justified over the large collection of datasets. On the other hand, it can be observed that time taken by our algorithm is quite less compared to other methods and justifies the theoretical findings.
References in corpus (25)
- The structure and function of complex networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Community detection in graphs
- Finding community structure in very large networks
- Fast algorithm for detecting community structure in networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Maps of random walks on complex networks reveal community structure
- Functional cartography of complex metabolic networks
- Near linear time algorithm to detect community structures in large-scale networks
- Comparing community structure identification
- Defining and identifying communities in networks
- Community detection in complex networks using Extremal Optimization
- Detecting fuzzy community structures in complex networks with a Potts model
- Finding Communities in Linear Time: A Physics Approach
- Detecting Network Communities: a new systematic and efficient algorithm
- Curvature of Co-Links Uncovers Hidden Thematic Layers in the World Wide Web
- Detecting communities in large networks
- A Classification for Community Discovery Methods in Complex Networks
- A Method to Find Community Structures Based on Information Centrality
- A Local Method for Detecting Communities
- Multiresolution community detection for megascale networks by information-based replica correlations
- Mixing local and global information for community detection in large networks
- Exploring the limits of community detection strategies in complex networks