Finding community structure in very large networks.

Abstract

The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their computational cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure. Many real-world networks are sparse and hierarchical, with m approximately n and d approximately log n, in which case our algorithm runs in essentially linear time, O (n log(2) n). As an example of the application of this algorithm we use it to analyze a network of items for sale on the web site of a large on-line retailer, items in the network being linked if they are frequently purchased by the same buyer. The network has more than 400 000 vertices and 2 x 10(6) edges. We show that our algorithm can extract meaningful communities from this network, revealing large-scale patterns present in the purchasing habits of customers.

Extracted Key Phrases

2 Figures and Tables

0200400'04'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

2,876 Citations

Semantic Scholar estimates that this publication has 2,876 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Clauset2004FindingCS, title={Finding community structure in very large networks.}, author={Aaron Clauset and M E J Newman and Cristopher Moore}, journal={Physical review. E, Statistical, nonlinear, and soft matter physics}, year={2004}, volume={70 6 Pt 2}, pages={066111} }