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
Emergence of consensus as a modular-to-nested transition in communication dynamics
TL;DR: This work develops a methodology that allows to cast all the previous aspects into a compact framework and to characterize, using microblogging data, information-driven systems as mutualistic networks and shows that collective attention around a topic is reached when the user-meme network self-adapts from a modular to a nested structure.
Proceedings ArticleDOI
Detecting emerging research fronts in regenerative medicine by citation network analysis of scientific publications
TL;DR: This paper divides citation networks into clusters using the topological clustering method, tracks the positions of papers in each cluster, and visualize citation networks with characteristic terms for each cluster and shows that the method succeeds to detect emerging research fronts in regenerative medicine.
Journal ArticleDOI
Influence-based community partition for social networks
TL;DR: The experimental results show that more accurate partitions according to influence propagation can be obtained using the algorithms developed rather than using some classic community partition algorithms, which are also useful for the influence propagation problem in social networks.
Journal ArticleDOI
Impact of random failures and attacks on Poisson and power-law random networks
TL;DR: The conclusion is that the basic results are clearly important, but in practice much less striking than generally thought, and the differences between random failures and attacks are not so huge and can be explained with simple facts.
Proceedings ArticleDOI
An evaluation of graph clustering methods for unsupervised term discovery.
TL;DR: An unprecedented evaluation of a wide range of advanced graph clustering methods for the UTD task finds that, for a range of features and languages, modularity-based clustering improves UTD performance most consistently, often by a wide margin.
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.