Finding community structure in very large networks.
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
Posted Content
Community Structure in Graphs
TL;DR: Graph vertices are often organized into groups that seem to live fairly independently of the rest of the graph, with which they share but a few edges, whereas the relationships between group members are stronger, as shown by the large number of mutual connections.
Journal ArticleDOI
Spectral methods for community detection and graph partitioning.
TL;DR: It is shown that with certain choices of the free parameters appearing in these spectral algorithms the algorithms for all three problems are identical, and hence there is no difference between the modularity- and inference-based community detection methods, or between either and graph partitioning.
Journal ArticleDOI
A classification for community discovery methods in complex networks
TL;DR: The aim of this survey is to provide a ‘user manual’ for the community discovery problem and to organize the main categories of community discovery methods based on the definition of community they adopt.
Journal ArticleDOI
Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition
TL;DR: Based on the proposed discrete framework, a multiobjective discrete particle swarm optimization algorithm is proposed to solve the network clustering problem and the decomposition mechanism is adopted.
Proceedings ArticleDOI
The Paradigm-Shift of Social Spambots: Evidence, Theories, and Tools for the Arms Race
TL;DR: In this article, the authors extensively study the social spambots on Twitter and provide quantitative evidence that a paradigm shift exists in spambot design and propose new approaches capable of turning the tide in the fight against this raising phenomenon.
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.