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
A Survey on Socially Aware Device-to-Device Communications
TL;DR: This paper presents a systematic overview of the socially unaware technical challenges and the prospective applications and provides a comprehensive survey on socially aware D2D communications, where various features of social-domain are leveraged to tackle the D1D technical issues and improve the performance of prospective D2d applications.
Journal ArticleDOI
High-Degree Neurons Feed Cortical Computations.
Nicholas M. Timme,Shinya Ito,Maxym Myroshnychenko,Sunny Nigam,Masanori Shimono,Fang-Chin Yeh,Pawel Hottowy,Alan Litke,John M. Beggs +8 more
TL;DR: These are the first results to show that the extent to which a neuron modifies incoming information streams depends on its topological location in the surrounding functional network.
Journal ArticleDOI
Structural network analysis of brain development in young preterm neonates.
Colin J. Brown,Steven P. Miller,Brian G. Booth,Shawn Andrews,Vann Chau,Kenneth J. Poskitt,Ghassan Hamarneh +6 more
TL;DR: This work examines a cohort of 47 normal preterm neonates scanned between 27 and 45 weeks post-menstrual age to further the understanding of how the structural connectome develops, observing that the brain networks in preterm infants, much like infants born at term, show high efficiency and clustering measures across a range of network scales.
Journal ArticleDOI
CC-GA: A clustering coefficient based genetic algorithm for detecting communities in social networks
Anwar Said,Anwar Said,Rabeeh Ayaz Abbasi,Rabeeh Ayaz Abbasi,Onaiza Maqbool,Ali Daud,Ali Daud,Naif Radi Aljohani +7 more
TL;DR: This paper proposes a novel algorithm, the Clustering Coefficient-based Genetic Algorithm (CC-GA), for detecting communities in social and complex networks, which is novel in terms of both the generation of the initial population and the mutation method.
Journal ArticleDOI
Motif-based communities in complex networks
TL;DR: In this article, the authors show how motifs can be used to define general classes of nodes, including communities, by extending the mathematical expression of Newman?Girvan modularity.
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.