A New Comparative Definition of Community and Corresponding Identifying Algorithm
arXiv:0802.0242 · doi:10.1103/PhysRevE.78.026121
Abstract
In this paper, a new comparative definition for community in networks is proposed and the corresponding detecting algorithm is given. A community is defined as a set of nodes, which satisfy that each node's degree inside the community should not be smaller than the node's degree toward any other community. In the algorithm, the attractive force of a community to a node is defined as the connections between them. Then employing attractive force based self-organizing process, without any extra parameter, the best communities can be detected. Several artificial and real-world networks, including Zachary Karate club network and College football network are analyzed. The algorithm works well in detecting communities and it also gives a nice description for network division and group formation.
11 pages, 4 fihures
References in corpus (26)
- Statistical mechanics of complex networks
- 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
- Fast algorithm for detecting community structure in networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- The diameter of the world wide web
- The large-scale organization of metabolic networks
- Resolution limit in community detection
- Comparing community structure identification
- Defining and identifying communities in networks
- Community detection in complex networks using Extremal Optimization
- How Popular is Your Paper? An Empirical Study of the Citation Distribution
- Finding local community structure in networks
- Detecting fuzzy community structures in complex networks with a Potts model
- Mixture models and exploratory analysis in networks
- Finding Communities in Linear Time: A Physics Approach
- Detecting communities in large networks
- A Local Method for Detecting Communities
- Maximizing Modularity is hard
- Local modularity measure for network clusterizations
- Identifying "communities" within energy landscapes
- Accuracy and Precision of Methods for Community Identification in Weighted Networks
Cited by in corpus (10)
- Community detection in graphs
- Community detection in networks: A user guide
- Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
- Robust network community detection using balanced propagation
- Finding and testing network communities by lumped Markov chains
- Fast Heuristic Algorithm for Multi-scale Hierarchical Community Detection
- Multi-resolution community detection in massive networks
- Finding overlapping communities in networks using evolutionary method
- On Finding the Community with Maximum Persistence Probability
- The impact of partially missing communities~on the reliability of centrality measures