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
疟原虫var基因转换速率变化导致抗原变异[英]/Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
TL;DR: PfPMP1)与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用,在黏附及免疫逃避中起关键的作�ly.
Journal ArticleDOI
Fast unfolding of communities in large networks
Vincent D. Blondel,Jean-Loup Guillaume,Jean-Loup Guillaume,Renaud Lambiotte,Renaud Lambiotte,Etienne Lefebvre +5 more
TL;DR: This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.
Journal ArticleDOI
Fast unfolding of communities in large networks
Vincent D. Blondel,Jean-Loup Guillaume,Jean-Loup Guillaume,Renaud Lambiotte,Renaud Lambiotte,Etienne Lefebvre +5 more
TL;DR: In this paper, the authors proposed a simple method to extract the community structure of large networks based on modularity optimization, which is shown to outperform all other known community detection methods in terms of computation time.
Journal ArticleDOI
Community detection in graphs
TL;DR: A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists.
The igraph software package for complex network research
Gábor Csárdi,Tamás Nepusz +1 more
TL;DR: Platform-independent and open source igraph aims to satisfy all the requirements of a graph package while possibly remaining easy to use in interactive mode as well.
References
More filters
Journal ArticleDOI
Spectral K-way ratio-cut partitioning and clustering
TL;DR: A spectral approach to multi-way ratio-cut partitioning that provides a generalization of the ratio- cut cost metric to L-way partitioning and a lower bound on this cost metric is developed.
Journal ArticleDOI
Subnetwork hierarchies of biochemical pathways
TL;DR: A method to decompose biochemical networks into subnetworks based on the global geometry of the network is presented and is applied to 43 organisms from the WIT database.
Journal ArticleDOI
Provably good mesh generation
TL;DR: It is shown how to triangulate a planar point set or a polygonally bounded domain with triangles of bounded aspect ratio, and how to produce a linear-size Delaunay triangulation of a multidimensional point set by adding a linear number of extra points.
Journal ArticleDOI
Networks of sexual contacts: implications for the pattern of spread of HIV.
TL;DR: This paper examines the influence of sexual contact patterns (mixing matrices) on the pattern of the AIDS epidemic in a male homosexual community via numerical studies of a mathematical model of the transmission dynamics of HIV with results shown to be assortative and disassortative.
Journal ArticleDOI
Detecting communities in large networks
TL;DR: An algorithm to detect community structure in complex networks based on spectral methods and takes into account weights and link orientation is developed, which proves to be successful both in clustering words, and in uncovering mental association patterns.