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
Posted Content

Graph Clustering with Graph Neural Networks

TL;DR: Deep Modularity Networks (DMoN), an unsupervised pooling method inspired by the modularity measure of clustering quality, is introduced and it is shown how it tackles recovery of the challenging clustering structure of real-world graphs.
Journal ArticleDOI

Causal deconvolution by algorithmic generative models

TL;DR: A universal, unsupervised and parameter-free model-oriented approach, based on the seminal concept and the first principles of algorithmic probability, to decompose an observation into its most likely algorithmic generative models to contribute to tackling the challenge of causation.
Journal ArticleDOI

Improved churn prediction in telecommunication industry by analyzing a large network

TL;DR: A new procedure of the churn prediction is proposed by examining the communication patterns among subscribers and considering a propagation process in a network based on call detail records which transfers churning information from churners to non-churners.
Journal ArticleDOI

Market basket analysis with networks

TL;DR: It is demonstrated that the network based approach can concisely isolate influence among products, mitigating the need to search through massive lists of association rules, and an interestingness measure for communities of products is developed and shown to isolates useful, actionable communities.
Journal ArticleDOI

Sequences of purchases in credit card data reveal lifestyles in urban populations.

TL;DR: In this article, the authors define a framework using a text compression technique on the sequences of credit card purchases to detect ubiquitous patterns of collective behavior and cluster the consumers by their similarity in purchase sequences.
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)