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
Uncovering Hierarchical and Overlapping Communities with a Local-First Approach
TL;DR: This work represents complex information in a network as multiple latent labels, and postulates that edges in the networks are created among nodes carrying similar labels, so that it can be used on real-world scale networks.
Journal ArticleDOI
Map equation for link communities.
Young-Do Kim,Hawoong Jeong +1 more
TL;DR: In this article, the authors extended the map equation method, which was originally developed for node communities, to find link communities in networks and compared with the metadata of the networks, and the results show that their method can identify the overlapping role of nodes effectively.
Journal ArticleDOI
Coexistence of opposite opinions in a network with communities
Renaud Lambiotte,Marcel Ausloos +1 more
TL;DR: The majority rule is applied to a topology that consists of two coupled random networks, thereby mimicking the modular structure observed in social networks and producing a phase diagram that depends on the frequency of random opinion flips and on the inter-connectivity between the two communities.
Journal ArticleDOI
Median evidential c-means algorithm and its application to community detection
TL;DR: A new prototype-based clustering method, called Median Evidential C-Means (MECM), which is an extension of median c-means and median fuzzy c- means on the theoretical framework of belief functions is proposed, which could be applied to graph clustering problems.
Proceedings ArticleDOI
Community detection in social networks with genetic algorithms
TL;DR: Experiments on a real life network show the capability of the method to successfully identify the network structure and the variation operators employed are suitably adapted to take into account the actual links among the nodes.
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.