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
Book ChapterDOI
On finding graph clusterings with maximum modularity
Ulrik Brandes,Daniel Delling,Marco Gaertler,Robert Görke,Martin Hoefer,Zoran Nikoloski,Dorothea Wagner +6 more
TL;DR: It is proved the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts, and an Integer Linear Programming formulation is given.
Journal ArticleDOI
Anatomy of news consumption on Facebook
Ana Lucia Schmidt,Fabiana Zollo,Michela Del Vicario,Alessandro Bessi,Antonio Scala,Guido Caldarelli,H. Eugene Stanley,Walter Quattrociocchi +7 more
TL;DR: The anatomy of the information space on Facebook is explored by characterizing on a global scale the news consumption patterns of 376 million users over a time span of 6 y, finding that users tend to focus on a limited set of pages, producing a sharp community structure among news outlets.
Proceedings ArticleDOI
Scalable Graph Exploration on Multicore Processors
TL;DR: This paper designs a breadth-first search algorithm for advanced multi-core processors that are likely to become the building blocks of future exascale systems, and presents an experimental study that uses state-of-the-art Intel Nehalem EP and EX processors and up to 64 threads in a single system.
Journal ArticleDOI
A dictionary of behavioral motifs reveals clusters of genes affecting Caenorhabditis elegans locomotion.
TL;DR: It is shown that four basic shapes, or eigenworms, previously described for wild-type worms, also capture mutant shapes, and that this representation can be used to build a dictionary of repetitive behavioral motifs in an unbiased way.
Posted Content
Finding Community Structure in Mega-scale Social Networks
Ken Wakita,Toshiyuki Tsurumi +1 more
TL;DR: It is shown that CNM algorithm does not scale well and its use is practically limited to networks whose sizes are up to 500,000 nodes and that a simple heuristics that attempts to merge community structures in a balanced manner can dramatically improve community structure analysis.
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.