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
Structural and functional discovery in dynamic networks with non-negative matrix factorization.
Shawn Mankad,George Michailidis +1 more
TL;DR: The development and application of matrix factorizations for exploration and time-varying community detection in time-evolving graph sequences are described and demonstrated.
Journal ArticleDOI
Influential nodes ranking in complex networks: An entropy-based approach
TL;DR: A new measure based on the basic notions in information theory to detect the spreading capability of nodes in networks on the basis of their topological information is proposed and shown to be more accurate and efficient than the similar ones.
Proceedings ArticleDOI
Toward signal processing theory for graphs and non-Euclidean data
TL;DR: This paper describes an approach based on detection theory and provides empirical results indicating that the test statistic proposed has reasonable power to detect dense subgraphs in large random graphs.
Journal ArticleDOI
Overlapping community detection via network dynamics.
TL;DR: In this paper, a method for community detection is proposed via the clustering dynamics of a network, which is illustrated with applications to both synthetically generated and real-world complex networks.
Journal ArticleDOI
Partitioning large signed two-mode networks: Problems and prospects
TL;DR: This work develops tools to partition these types of networks and compares them with other approaches using a recently collected dataset of United Nations General Assembly roll call votes, the first step towards bridging Heider's structural balance theory with recent theorizing in international relations on soft balancing of power processes.
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.