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
Connectomics and neuroticism: an altered functional network organization.
Michelle N. Servaas,Linda Geerligs,Remco J. Renken,Jan-Bernard C Marsman,Johan Ormel,Harriëtte Riese,André Aleman +6 more
TL;DR: The ‘neurotic brain’ has a less than optimal functional network organization and shows signs of functional disconnectivity.
Book ChapterDOI
Impact of Community Structure on SAT Solver Performance
TL;DR: This paper provides evidence that the community structure of real-world SAT instances is correlated with the running time of CDCL SAT solvers, and shows that the number of communities and the Q value of the graph ofreal-world Sat instances is more predictive of theRunning time ofCDCL solvers than traditional metrics like number of variables or clauses.
Posted Content
Party Polarization in Congress: A Network Science Approach
TL;DR: In this paper, the authors measure polarization in the United States Congress using the network science concept of modularity, which reveals both the number of relevant groups and the strength of inter-group divisions without making restrictive assumptions about the structure of the party system or the shape of legislator utilities.
Journal ArticleDOI
Stochastic Competitive Learning in Complex Networks
TL;DR: A rigorous definition of a new type of competitive learning scheme realized on large-scale networks that consists of several particles walking within the network and competing with each other to occupy as many nodes as possible, while attempting to reject intruder particles is presented.
Journal ArticleDOI
Overlapping Community Detection based on Network Decomposition
TL;DR: A new overlapping community detection algorithm based on network decomposition, called NDOCD, which iteratively splits the network by removing all links in derived link communities, which are identified by utilizing node clustering technique rather than link similarity measure to discover link communities.
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.