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
Proceedings ArticleDOI
Matched filtering for subgraph detection in dynamic networks
TL;DR: This paper presents a matched filtering method for graph sequences, extending to a dynamic setting a previous method for the detection of anomalously dense subgraphs in a large background, and demonstrates background/foreground separation using a real background graph based on a computer network.
Journal ArticleDOI
An order-based algorithm for minimum dominating set with application in graph mining
David Chalupa,David Chalupa +1 more
TL;DR: A new order-based randomised local search algorithm (RLSo) is proposed to solve minimum dominating set problem in large graphs and indicates that RLSo performs better than both a classical greedy approximation algorithm and two metaheuristic algorithms based on ant colony optimisation and local search.
Journal ArticleDOI
Differential network enrichment analysis reveals novel lipid pathways in chronic kidney disease.
Jing Ma,Alla Karnovsky,Farsad Afshinnia,Janis E. Wigginton,Daniel J. Rader,Loki Natarajan,Kumar Sharma,Anna C. Porter,Mahboob Rahman,Jiang He,L. Lee Hamm,Tariq Shafi,Debbie S. Gipson,Crystal A. Gadegbeku,Harold I. Feldman,George Michailidis,George Michailidis,Subramaniam Pennathur +17 more
TL;DR: Altered alterations in triacylglycerols and cardiolipins-phosphatidylethanolamines that precede the clinical outcome of end-stage kidney disease by several years are demonstrated.
Journal ArticleDOI
A Framework for Robust Online Video Contrast Enhancement Using Modularity Optimization
Anustup Choudhury,Gerard Medioni +1 more
TL;DR: This work addresses the problem of video contrast enhancement by analyzing video streams and cluster frames that are similar to each other and evaluating the clustering method on video sequences from the TRECVid 2001 dataset and comparing it with existing methods.
Journal ArticleDOI
On the role of sparseness in the evolution of modularity in gene regulatory networks
TL;DR: The results suggest that sparseness alone is neither sufficient nor necessary to explain modularity in gene regulatory networks, however,Sparseness amplifies the effects of forms of selection that, like selection for additional gene activity patterns, already produce an increase in modularity.
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.