scispace - formally typeset
Open AccessJournal ArticleDOI

Finding community structure in networks using the eigenvectors of matrices

Mark Newman
- 11 Sep 2006 - 
- Vol. 74, Iss: 3, pp 036104-036104
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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Detection of node group membership in networks with group overlap

TL;DR: In this article, the authors introduce an ensemble of networks with overlapping groups, and apply three group identification methods (i.e., modularity maximization, k-clique percolation, and modularity-landscape surveying) to these networks.
Journal ArticleDOI

Functional connectivity relationships predict similarities in task activation and pattern information during associative memory encoding

TL;DR: Brain networks are defined using resting state functional connectivity (RSFC) and functional similarity of regions within each network during an associative memory encoding task is quantified, suggesting that components of neural systems defined on the basis of RSFC share similar functional properties in terms of recruitment during cognitive tasks and information carried in voxel patterns.
Journal ArticleDOI

Structure and stability of the coral microbiome in space and time.

TL;DR: It is found that microbial community dissimilarity increased with geographical distance, which indicates that regional processes such as dispersal limitation and spatiotemporal environmental heterogeneity also influence microbial community composition.
Proceedings ArticleDOI

Community detection using Ant Colony Optimization

TL;DR: This paper proposes an Ant Colony Optimization (ACO) approach to address the community detection problem by maximizing the modularity measure, and proposes a new kind of heuristic based on the correlation between vertices.
Journal ArticleDOI

Spectra of random graphs with community structure and arbitrary degrees.

TL;DR: The spectrum has two parts, a continuous spectral band, which can depart strongly from the classic semicircle form, and a set of outlying eigenvalues that indicate the presence of communities.
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

宁北芳, +1 more
TL;DR: PfPMP1)与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用,在黏附及免疫逃避中起关键的作�ly.
Journal ArticleDOI

The Structure and Function of Complex Networks

Mark Newman
- 01 Jan 2003 - 
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.
Related Papers (5)