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
A novel approach to identify the major research themes and development trajectory: The case of patenting research
Louis Y.Y. Lu,John S. Liu +1 more
TL;DR: This study retrieves patenting related articles covering 1970 to 2013 from Web of Science and constructs the citation network among them and demonstrates that the approach used herein is a powerful way to determine the major research themes and development trajectories of a target academic field.
Journal ArticleDOI
Optimal resilience of modular interacting networks.
Gaogao Dong,Gaogao Dong,Fan Wang,Fan Wang,Louis M. Shekhtman,Michael M. Danziger,Jingfang Fan,Jingfang Fan,Ruijin Du,Jian-Guo Liu,Jian-Guo Liu,Lixin Tian,H. Eugene Stanley,Shlomo Havlin +13 more
TL;DR: In this article, the authors develop two frameworks to explore the resilience of modular networks, including specific deterministic coupling patterns and coupling patterns where specific subnetworks are connected randomly, and they find both analytically and numerically that the location of the percolation phase transition varies nonmonotonically with the fraction of interconnected nodes when the total number of interconnecting links remains fixed.
Journal ArticleDOI
Size Matters: A Comparative Analysis of Community Detection Algorithms
TL;DR: In this paper, the authors propose a heuristic clique-based algorithm which controls the size and overlap of communities with adjustable parameters and evaluate it along with six state-of-the-art community detection algorithms on both Twitter and DBLP networks.
Journal ArticleDOI
Evolutionary algorithm and modularity for detecting communities in networks
TL;DR: This paper develops a new approach of community detection in networks based on evolutionary algorithm that uses an evolutionary algorithm to find the first community structure that maximizes the modularity and improves the community structure through merging communities.
Journal ArticleDOI
Label propagation algorithm based on local cycles for community detection
TL;DR: An improved LPA based on local cycles is given and the result shows that the performance of the proposed approach is even significantly improved.
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.