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
Localization on low-order eigenvectors of data matrices
TL;DR: A very simple model is presented that suggests certain coarse structural similarities among the seemingly-unrelated applications where low-order eigenvector localization is present, and it may be used as a diagnostic tool to help extract insight from data graphs when such low-orders are present.
Journal ArticleDOI
Clubs of Clubs: Fragmentation in the Network of Intergovernmental Organizations
Brian Greenhill,Yonatan Lupu +1 more
TL;DR: In this article, the authors focus on a specific form of potential fragmentation in the international system: the extent to which the network of intergovernmental organizations (IGOs) consists of distinct clusters of closely cooperating states, and show that the structure of the IGO network can generally be divided into distinct groups of states on the basis of their shared IGO memberships.
Journal ArticleDOI
Influence of edge weight on node proximity based link prediction methods
TL;DR: This paper revisits the study of the effect of tie weight on link prediction, and proposes two new weighting models namely, min-flow and multiplicative, and performs an analysis of the weak tie theory, and observes that unweighted models are suitable for inter-community link Prediction, and weighted models are suited for intra- community link prediction.
Journal ArticleDOI
Active semi-supervised community detection based on must-link and cannot-link constraints.
TL;DR: A semi-supervised community detection algorithm, which makes full utilization of the must-link and cannot-link constraints to guide the process of community detection and thereby extracts high-quality community structures from networks.
Journal ArticleDOI
Ranking influential nodes in complex networks with structural holes
TL;DR: The simulation results on the susceptible–infectious–recovered (SIR) dynamics suggest that the proposed E-Burt method can rank influential nodes more effectively and accurately in complex networks.
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.