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
Journal ArticleDOI
A genetic algorithm for detecting communities in large-scale complex networks
TL;DR: A genetic algorithm with a special encoding schema for community detection in complex networks, which employs a metric, named modularity Q as the fitness function and applies a special locus-based adjacency encoding schema to represent the community partitions.
Journal ArticleDOI
Continuous‐cropping tobacco caused variance of chemical properties and structure of bacterial network in soils
TL;DR: Soil chemical properties and tobacco agronomical properties were negatively affected by the continuous‐cropping obstacle, and the bacterial network properties under continuous cropping are more sensitive to soil variables because there are less bacterial species that interact each other and this is due to limited nutrients or excessive toxic nutrient.
Journal ArticleDOI
Measuring the robustness of network community structure using assortativity
TL;DR: An existing framework for bootstrapping network metrics is extended to provide a method for assessing the robustness of community assignment in social networks using a metric the authors call community assortativity (rcom), and it is shown that modularity can reliably detect the transition from random to structured associations in networks that differ in size and number of communities.
Journal ArticleDOI
Modular structure of functional networks in olfactory memory.
TL;DR: Some evidence is provided that the neural networks involved in odor recognition memory are organized into modules and that these modular partitions are linked to behavioral performance and individual strategies.
Proceedings ArticleDOI
On clustering heterogeneous social media objects with outlier links
TL;DR: A probability measure is designed on the social media networks which output a configuration of clusters that are consistent with both content and link structure and the advantage of the method is shown over other state-of-the-art algorithms.
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.