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
Least Cost Influence Maximization Across Multiple Social Networks
TL;DR: This article proposes a unified framework to represent and analyze the influence diffusion in multiplex networks by mapping a set of networks into a single one via lossless and lossy coupling schemes.
Journal ArticleDOI
Finding missing edges in networks based on their community structure.
Bowen Yan,Steve Gregory +1 more
TL;DR: This work proposes a strategy for edge prediction that combines existing edge prediction methods with community detection, and shows that this method gives better prediction accuracy than existing edge Prediction methods alone.
Journal ArticleDOI
Quantum navigation and ranking in complex networks.
TL;DR: In this paper, the authors define a quantum navigation method providing a unique ranking of the elements of a network and analyze the convergence of quantum navigation to the stationary rank of networks and show that quantumness decreases the number of navigation steps before convergence.
Journal ArticleDOI
Model selection and hypothesis testing for large-scale network models with overlapping groups
TL;DR: In this paper, the minimum description length principle is used to reliably model networks and robustly differentiate models on the basis of confidence levels, which can be used to model a network with too many parameters is likely to lead to overfitting.
Journal ArticleDOI
Toward Predicting Collective Behavior via Social Dimension Extraction
TL;DR: The SocioDim framework demonstrates promising results toward predicting collective behavior, but many challenges require further research, and it is intriguing to consider temporal fluctuation into the problem of collective behavior prediction.
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.