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
The degree-related clustering coefficient and its application to link prediction
TL;DR: A degree-related clustering coefficient index to quantify the clustering ability of nodes, which is highly robust when the observed bias of links is considered and applies to the link prediction problem.
Journal ArticleDOI
Toward finding hidden communities based on user profile
TL;DR: This work considers the community detection problem from a partially observable network structure where some edges are not observable, and proposes a simple model to utilize both the observed connectivity relation and the profile graph.
Journal ArticleDOI
Community detection in social networks with node attributes based on multi-objective biogeography based optimization
TL;DR: A multi-objective discrete Biogeography Based Optimization (BBO) algorithm to find communities in social networks with node attributes using the Pareto-based approach and introduces a method for mutation probability approximation and uses a chaotic mechanism to dynamically tune the mutation probability in each iteration.
Journal ArticleDOI
Multivariate Spatiotemporal Hawkes Processes and Network Reconstruction
TL;DR: This paper develops a nonparametric method for network reconstruction from spatiotemporal data sets using multivariate Hawkes processes that yields improved network reconstruction, providing a basis for meaningful subsequent analysis of the reconstructed networks.
Journal ArticleDOI
A flexible methodology to sectorize water supply networks based on social network theory concepts and multi-objective optimization
Enrique Campbell,Joaquín Izquierdo,Idel Montalvo,Amilkar E. Ilaya-Ayza,Rafael Pérez-García,M. Tavera +5 more
TL;DR: A novel methodology to sectorize water supply networks depending on a main transmission line based on communities found using a community detection algorithm (Walktrap) and a multi-objective optimization process by means of agent swarm optimization (ASO).
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.