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
On Modularity - NP-Completeness and Beyond
Ulrik Brandes,Daniel Delling,Marco Gaertler,Robert Görke,Martin Hoefer,Zoran Nikolski,Dorothea Wagner +6 more
TL;DR: The complexity status of modularity maximization is resolved showing that the corresponding decision version is NP-complete in the strong sense and the formulation as an Integer Linear Program (ILP) to facilitate exact optimization.
Journal ArticleDOI
CyREST: Turbocharging Cytoscape Access for External Tools via a RESTful API.
TL;DR: The new cyREST Cytoscape app and accompanying harmonization libraries are presented, which improve workflow reproducibility and researcher productivity by enabling popular languages and tools to directly define and query networks, and perform network analysis, layouts and renderings.
Journal ArticleDOI
Towards Bayesian Quantification of Permeability in Micro-scale Porous Structures – The Database of Micro Networks
TL;DR: A Bayesian framework to quantify the absolute permeability of water in a porous structure from the geometry and clustering parameters of its underlying pore-throat network, using a Database of Micro Networks for micro-scale porous structures as main input stream for the proposed Bayesian scheme.
Proceedings ArticleDOI
Community Detection Based on Structure and Content: A Content Propagation Perspective
TL;DR: The topological structure of a network as well as the content information of nodes are combined in the task of detecting communities in information networks and the nature of communities is described by analyzing the stable status of the dynamic system.
Journal ArticleDOI
Revealing Density-Based Clustering Structure from the Core-Connected Tree of a Network
TL;DR: By projecting an undirected network to its core-connected maximal spanning tree, the clustering problem can be converted to detect core connectivity components on the tree and the density-based clustering of a specific parameter setting and the hierarchical clustering structure both can be efficiently extracted from the tree.
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.