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
Posted Content
Towards Better Analysis of Deep Convolutional Neural Networks
TL;DR: A hybrid visualization is developed to disclose the multiple facets of each neuron and the interactions between them and a biclustering-based edge bundling method is proposed to reduce visual clutter caused by a large number of connections between neurons.
Journal ArticleDOI
Equivalence between modularity optimization and maximum likelihood methods for community detection.
TL;DR: An exact equivalence is shown between maximization of the generalized modularity that includes a resolution parameter and the special case of the block model known as the planted partition model, in which all communities in a network are assumed to have statistically similar properties.
Journal ArticleDOI
Modularity-Maximizing Graph Communities via Mathematical Programming
TL;DR: This paper introduces the technique of rounding mathematical programs to the problem of modularity maximization, presenting two novel algorithms that perform comparably or better than past algorithms, while being more efficient than exhaustive techniques.
Posted Content
Citation-based clustering of publications using CitNetExplorer and VOSviewer
Nees Jan van Eck,Ludo Waltman +1 more
TL;DR: In this paper, two software tools, CitNetExplorer and VOSviewer, are used to cluster scientific publications and to analyze the resulting clustering solutions using visualizations.
Posted Content
Community Detection in Complex Networks Using Genetic Algorithms
TL;DR: The em-ployment of a genetic algorithm to detect communities in complex networks which is based on optimizing network modularity is presented, which does not need any prior knowledge about the number of commu-nities.
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.