Fast algorithm for detecting community structure in networks.
TLDR
An algorithm is described which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms.Abstract:
Many networks display community structure--groups of vertices within which connections are dense but between which they are sparser--and sensitive computer algorithms have in recent years been developed for detecting this structure. These algorithms, however, are computationally demanding, which limits their application to small networks. Here we describe an algorithm which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms. We give several example applications, including one to a collaboration network of more than 50,000 physicists.read more
Citations
More filters
Journal ArticleDOI
Flow Mapping and Multivariate Visualization of Large Spatial Interaction Data
TL;DR: The proposed approach can process relatively large data sets and effectively discover and visualize major flow structures and multivariate relations at the same time and is supported to facilitate the understanding of both an overview and detailed patterns.
Journal ArticleDOI
Detecting complex network modularity by dynamical clustering
TL;DR: Based on cluster desynchronization properties of phase oscillators, an efficient method is introduced for the detection and identification of modules in complex networks with a high level of precision.
Journal ArticleDOI
Persistent Brain Network Homology From the Perspective of Dendrogram
TL;DR: A novel multiscale framework that models all brain networks generated over every possible threshold and is based on persistent homology and its various representations such as the Rips filtration, barcodes, and dendrograms to quantify various persistent topological features at different scales in a coherent manner.
Journal ArticleDOI
Advanced modularity-specialized label propagation algorithm for detecting communities in networks
Xin Liu,Tsuyoshi Murata +1 more
TL;DR: Experiments show that LPAm+ successfully detects communities with higher modularity values than ever reported in two commonly used real-world networks and offers a fair compromise between accuracy and speed.
Journal ArticleDOI
Uncovering latent structure in valued graphs: A variational approach
TL;DR: In this paper, a model-based strategy to uncover groups of nodes in valued graphs is presented, which can be used for a wide span of parametric random graphs models and allows to include covariates.
References
More filters
疟原虫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.
Journal ArticleDOI
Community structure in social and biological networks
Michelle Girvan,Mark Newman +1 more
TL;DR: This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Journal ArticleDOI
Finding and evaluating community structure in networks.
TL;DR: It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.