Fast Community Identification by Hierarchical Growth
arXiv:physics/0602144 · doi:10.1142/S0129183107011042
Abstract
A new method for community identification is proposed which is founded on the analysis of successive neighborhoods, reached through hierarchical growth from a starting vertex, and on the definition of communities as a subgraph whose number of inner connections is larger than outer connections. In order to determine the precision and speed of the method, it is compared with one of the most popular community identification approaches, namely Girvan and Newman's algorithm. Although the hierarchical growth method is not as precise as Girvan and Newman's method, it is potentially faster than most community finding algorithms.
6 pages, 5 figures
References in corpus (14)
- The structure and function of complex networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Cooperative Game Theory Approaches for Network Partitioning
- Functional cartography of complex metabolic networks
- Characterization of complex networks: A survey of measurements
- Defining and identifying communities in networks
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
- Community detection in complex networks using Extremal Optimization
- Why social networks are different from other types of networks
- Finding local community structure in networks
- Detecting communities in large networks
- A Local Method for Detecting Communities
- Community analysis in social networks