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
Posted Content
Properties of Latent Variable Network Models
TL;DR: In this article, the authors introduce the Gaussian Latent Position Model, and derive analytic expressions and asymptotic approximations for its network properties, including the average degree distribution, clustering coefficient, average path length and degree correlations.
Journal ArticleDOI
Core-periphery structure requires something else in the network
Sadamori Kojaku,Naoki Masuda +1 more
TL;DR: This work proposes a scalable algorithm to detect pairs of core and periphery in networks, controlling for the effect of the node's degree, and illustrates the algorithm using various empirical networks.
Journal ArticleDOI
Identification of Literary Movements Using Complex Networks to Represent Texts
TL;DR: This study identified literary movements by treating books published from 1590 to 1922 as complex networks, whose metrics were analyzed with multivariate techniques to generate six clusters of books.
Journal ArticleDOI
Emergence of a multilayer structure in adaptive networks of phase oscillators
Vladimir V. Makarov,Vladimir V. Makarov,A. A. Koronovskii,A. A. Koronovskii,Vladimir A. Maksimenko,Vladimir A. Maksimenko,Alexander E. Hramov,Alexander E. Hramov,Olga I. Moskalenko,Olga I. Moskalenko,Javier M. Buldú,Stefano Boccaletti +11 more
TL;DR: In this article, the authors report on self-organization of adaptive networks, where topology and dynamics evolve in accordance to a competition between homophilic and homeostatic mechanisms, and where links are associated to a vector of weights.
Journal ArticleDOI
Large-scale community detection based on node membership grade and sub-communities integration
TL;DR: The proposed algorithm employs a framework resembling label propagation, which has low time complexity and is suitable for detecting communities in large-scale networks, and experimental results indicate the accuracy and efficiency of the proposed algorithm.
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.