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
Optics: a bibliometric approach to detect emerging research domains and intellectual bases
Yoshiyuki Takeda,Yuya Kajikawa +1 more
TL;DR: This paper constructed a citation network of papers and performed topological clustering method to investigate the structure of research and to detect emerging research domains in optics, finding that optics consists of main five subclusters.
A Locally Optimal Heuristic for Modularity Maximization of Networks
TL;DR: In this paper, a divisive heuristic is proposed to detect communities in a hierarchical network, in which each successive bipartition is done in a provably optimal way, and the proposed heuristic gives better results than the divisive heuristics of Newman and than the agglomerative heuristic of Clauset et al.
Proceedings ArticleDOI
HiMap: Adaptive visualization of large-scale online social networks
TL;DR: This paper presents HiMap, a system that visualizes it by clustered graph via hierarchical grouping and summarization using a novel adaptive data loading technique and provides an integrated suite of interactions to allow the users to easily navigate the social map with smooth and coherent view transitions to keep their momentum.
Proceedings ArticleDOI
A scalable eigensolver for large scale-free graphs using 2D graph partitioning
TL;DR: It is demonstrated that the enhanced eigensolver can attain two orders of magnitude performance improvement compared to the original on a state-of-art massively parallel machine.
Journal ArticleDOI
Unveiling community structures in weighted networks.
TL;DR: An algorithm is presented based on the definition of an effective transition matrix Pij to account for the probability of going from vertex i to any vertex j of the original connected graph G to extract a topological feature related to the manner by which graph G has been organized.
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.