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
Testing the Significance of Connectivity Networks: Comparison of Different Assessing Procedures
TL;DR: Asymptotic statistics provide an approach to the assessment of PDC significance with comparable performances with respect to the previously used empirical approaches but with a substantial advantage in terms of computational time.
Journal ArticleDOI
Prediction of missing links based on multi-resolution community division
TL;DR: A simple link prediction method, which fully explore the community structure information of the networks, which has a good performance on the accuracy and a lower time complexity than any other algorithms which are based on hierarchical structure of the network.
Journal ArticleDOI
Longitudinal cortical network reorganization in early relapsing-remitting multiple sclerosis.
Vinzenz Fleischer,Nabin Koirala,Amgad Droby,René-Maxime Gracien,Ralf Deichmann,Ulf Ziemann,Sven G. Meuth,Muthuraman Muthuraman,Frauke Zipp,Sergiu Groppa +9 more
TL;DR: Evidence is provided for gray matter network reorganization subsequent to clinical disease manifestation in patients with early RRMS, and an adaptive cortical response with increased local network characteristics favoring network segregation could play a primordial role for maintaining brain function in response to neuroinflammation.
Proceedings Article
Uncovering cross-dimension group structures in multi-dimensional networks
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 then integrates them to find out a robust community structure among actors.
Journal ArticleDOI
Improving heuristics for network modularity maximization using an exact algorithm
TL;DR: This work presents an approach to be applied as a post-processing to heuristic methods in order to improve their performances and shows that the proposed approach is effective in improving heuristic results.
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.