Finding community structure in very large networks.
Reads0
Chats0
TLDR
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.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.read more
Citations
More filters
Journal ArticleDOI
Structure and Overlaps of Ground-Truth Communities in Networks
Jaewon Yang,Jure Leskovec +1 more
TL;DR: The community-affiliation graph model (AGM), a conceptual model of network community structure, is presented and it is demonstrated that AGM reliably captures the overall structure of networks as well as the overlapping and hierarchical nature of network communities.
Journal ArticleDOI
Understanding the bias of call detail records in human mobility research
TL;DR: It is found that CDRs tend to underestimate the total travel distance and the movement entropy, while they can provide a good estimate to the radius of gyration, and it is suggested that researchers use caution to interpret results derived from CDR data.
Journal ArticleDOI
Salt stress and senescence: identification of cross-talk regulatory components
TL;DR: This study identifies candidate H2O2-responsive cis-regulatory elements governing gene expression during salinity stress-triggered and developmental senescence.
Proceedings Article
Detecting Communities in Social Networks Using Max-Min Modularity.
TL;DR: A new community mining measure, Max-Min Modularity, which considers both connected pairs and criteria defined by domain experts in finding communities, and then specifies a hierarchical clustering algorithm to detect communities in networks shows improvement over previous algorithms.
Journal ArticleDOI
On community structure in complex networks: challenges and opportunities
TL;DR: This work focuses on generative models of communities in complex networks and their role in developing strong foundation for community detection algorithms, and introduces deterministic strategies that have proven to be very efficient in controlling the epidemic outbreaks, but require complete knowledge of the network.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
疟原虫var基因转换速率变化导致抗原变异[英]/Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
TL;DR: PfPMP1)与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用,在黏附及免疫逃避中起关键的作�ly.
Journal ArticleDOI
Statistical mechanics of complex networks
TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.
Journal ArticleDOI
The Structure and Function of Complex Networks
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.