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
iNAP: An integrated network analysis pipeline for microbiome studies
Kai Feng,Xi Peng,Zheng Zhang,Songsong Gu,Qing He,Wenli Shen,Zhujun Wang,Danrui Wang,Qiu-Long Hu,Yan Li,Shuang Wang,Ye Deng +11 more
TL;DR: Integrated network analysis pipeline (iNAP) as discussed by the authors is an online analysis pipeline for generating and analyzing comprehensive ecological networks in microbiome studies, which is implemented in two sections, that is, network construction and network analysis, and integrates many open access tools.
Dissertation
Bandits Games and Clustering Foundations
TL;DR: This thesis discusses two important theoretical concepts for clustering, namely the consistency of algorithms and the stability as a tool for model selection in stochastic optimization and online learning.
Journal ArticleDOI
Detecting community structure in complex networks using simulated annealing with k-means algorithms
Jian Liu,Tingzhan Liu +1 more
TL;DR: The simulated annealing strategy is used to maximize the modularity of a network, associating with a dissimilarity-index-based and with a diffusion-distance-based k-means iterative procedure, which outperform most existing methods as regards the optimal modularity found.
Journal ArticleDOI
Rich-club vs rich-multipolarization phenomena in weighted networks.
TL;DR: It is found that in some real networks the results given by the weighted rich-club coefficient can be in sharp contrast to the ones in the unweighted approach, which matters for correct understanding of functionalities and dynamical processes relying on hub interconnectedness.
Journal ArticleDOI
A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks
TL;DR: It is shown that in general the weight neighborhood centrality can rank the spreading ability of nodes more accurately than its benchmark centrality, especially when using the degree k or coreness ks as the benchmarkcentrality.
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.