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 Article
Query Transformation Based on Semantic Centrality in Semantic Social Network1.
TL;DR: A new measurement of semantic centrality is proposed, i.e., the power of semantic bridging on semantic peer-to-peer environment, to build semantically cohesive user subgroups, so that semantic affinities between peers can be computed.
Community detection in complex networks
TL;DR: This work combines classic ideas in topic modeling with a variant of the mixed-membership block model recently developed in the statistical physics community, which has the advantage that its parameters can be inferred with a simple and scalable expectation-maximization algorithm.
Journal ArticleDOI
Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient
TL;DR: An alternate algorithm for detecting overlapping community structures in the complex network using the maximal sub-graph and the clustering coefficient and a new extended modularity is proposed to quantify this algorithm.
Journal ArticleDOI
Hypergraph partitioning for social networks based on information entropy modularity
TL;DR: Findings show that EQHyperpart partitioners are more scalable than competing approaches, achieving a tradeoff between modularity retaining and cut size minimizing under balance constraints, and an auto-tradeoff without balance constraints for hypergraph modeled social networks.
Journal ArticleDOI
Community detection in networks via a spectral heuristic based on the clustering coefficient
TL;DR: A spectral heuristic based on a measure known as clustering coefficient to detect communities in networks, which favors clusterings with a strong neighborhood structure inside clusters, apparently, overcoming the scale deficiency of the modularity maximization problem.
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.