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
Proceedings ArticleDOI
Sampling community structure
TL;DR: This work proposes a novel method, based on concepts from expander graphs, to sample communities in networks and produces subgraphs representative of community structure in the original network that can effectively be used to infer and approximate community affiliation in the larger network.
Journal ArticleDOI
Limited resolution in complex network community detection with Potts model approach
TL;DR: In this article, the q-state Potts community detection method introduced by Reichardt and Bornholdt also has a resolution threshold and a parameter by which this threshold can be tuned, but no a priori principle is known to select the proper value.
Proceedings ArticleDOI
Uncoverning Groups via Heterogeneous Interaction Analysis
Lei Tang,Xufei Wang,Huan Liu +2 more
TL;DR: This work proposes a two-phase strategy to identify the hidden structures shared across dimensions in multi-dimensional networks, which extracts structural features from each dimension of the network via modularity analysis, and integrates them all to find out a robust community structure among actors.
Journal ArticleDOI
Metrics for Community Analysis: A Survey
TL;DR: A survey of the metrics used for community detection and evaluation can be found in this paper, where the authors also conduct experiments on synthetic and real networks to present a comparative analysis of these metrics in measuring the goodness of the underlying community structure.
Journal ArticleDOI
Disrupted modular brain dynamics reflect cognitive dysfunction in Alzheimer's disease
TL;DR: The results of this study demonstrate that particularly the loss of communication between different functional brain regions reflects cognitive decline in Alzheimer's disease, and imply the relevance of regarding dementia as a functional network disorder.
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.