Finding community structure in networks using the eigenvectors of matrices
Reads0
Chats0
TLDR
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed.Abstract:
We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as ``modularity'' over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.read more
Citations
More filters
Journal ArticleDOI
Impact of heterogeneous activity and community structure on the evolutionary success of cooperators in social networks.
TL;DR: This work considers the evolutionary prisoner's dilemma game taking place on top of a real social network to investigate how the community structure and the heterogeneity in activity of individuals affect the evolution of cooperation, and finds that the abundance of communities in the social network can evidently foster the formation of cooperation under strong selection, in contrast to the games evolving on randomized counterparts.
Journal ArticleDOI
Label propagation algorithm: a semi-synchronous approach
Gennaro Cordasco,Luisa Gargano +1 more
TL;DR: A semi-synchronous version of LP algorithms which aims to combine the advantages of both synchronous and asynchronous models is presented and it is proved that the models always converge to a stable labelling.
Journal ArticleDOI
A perturbation-based framework for link prediction via non-negative matrix factorization.
TL;DR: A perturbation-based framework based on Non-negative Matrix Factorization to predict missing links and shows that the proposed framework has competitive performances compared with state-of-the-art link prediction methods.
Journal ArticleDOI
Identifying influential spreaders by weight degree centrality in complex networks
TL;DR: A successful ranking method for identifying the influential spreaders in complex networks by measuring the spreading ability of nodes based on their degree and their ability of spreading out is proposed.
Journal ArticleDOI
Coalitions, tipping points and the speed of evolution
Jonathan Newton,Simon D. Angus +1 more
TL;DR: This study considers waiting times for populations to achieve efficient social coordination and conjecture that coalitional behavior will hasten such coordination turns out to be true when every member of the population interacts with every other member, but does not extend to more complex networks of interaction.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
The Strength of Weak Ties
TL;DR: In this paper, it is argued that the degree of overlap of two individuals' friendship networks varies directly with the strength of their tie to one another, and the impact of this principle on diffusion of influence and information, mobility opportunity, and community organization is explored.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
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.