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
Nodes' Evolution Diversity and Link Prediction in Social Networks
TL;DR: A diverse node adaption algorithm is proposed to indirectly analyze the evolution of the entire network based on the nodes’ evolution diversity and outperforms other state-of-the-art link prediction algorithms in terms of both accuracy and universality.
Journal ArticleDOI
Quantum Optimization and Quantum Learning: A Survey
TL;DR: This paper lists major breakthroughs in the development of quantum domain, then summarizes the existing quantum algorithms from two aspects: quantum optimization and quantum learning, and proves that quantum intelligent algorithms have strong competitiveness compared with traditional intelligent algorithms and possess great potential by simulating quantum computing.
Journal ArticleDOI
Temporal evolution of contacts and communities in networks of face-to-face human interactions
TL;DR: This article analyzes the evolution of contacts and communities over time to consider the stability of the respective communities and assess different factors which have an influence on the quality of community prediction.
Journal ArticleDOI
An improved gravity model to identify influential nodes in complex networks based on k-shell method
Xuan Yang,Fuyuan Xiao +1 more
TL;DR: This work proposes an improved gravity centrality measure on the basis of the k-shell algorithm named KSGC to identify influential nodes in the complex networks, which takes the location of nodes into consideration, which is more reasonable compared to original gravityCentrality measure.
Journal ArticleDOI
Community detection in complex networks
TL;DR: In this paper, a novel multi-objective discrete backtracking search optimization algorithm with decomposition is proposed for community detection in complex networks, where the updating rules of individuals are redesigned based on the network topology.
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.