scispace - formally typeset
Open AccessJournal ArticleDOI

Fast algorithm for detecting community structure in networks.

Mark Newman
- 18 Jun 2004 - 
- Vol. 69, Iss: 6, pp 066133-066133
TLDR
An algorithm is described which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms.
Abstract
Many networks display community structure--groups of vertices within which connections are dense but between which they are sparser--and sensitive computer algorithms have in recent years been developed for detecting this structure. These algorithms, however, are computationally demanding, which limits their application to small networks. Here we describe an algorithm which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms. We give several example applications, including one to a collaboration network of more than 50,000 physicists.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Communities and bottlenecks: trees and treelike networks have high modularity.

TL;DR: It is shown that trees and treelike networks can have unexpectedly and often arbitrarily high values of modularity, which is surprising since trees are maximally sparse connected graphs and are not typically considered to possess modular structure, yet the nonlocal null model used by modularity assigns low probabilities, and thus high significance, to the densities of these sparse tree communities.
Journal ArticleDOI

Immunization of networks with community structure

TL;DR: An analytical framework for immunizing modular networks is developed on the basis of an immunization strategy based on eigenvector centrality and the contribution of each node to the connectivity in a coarse-grained network among modules is quantified.
Journal ArticleDOI

Compression of Flow Can Reveal Overlapping-Module Organization in Networks

TL;DR: This work introduces the map equation for overlapping modules, a framework for understanding the organization of overlapping modules in large networks with respect to flow in this information-theoretic framework.
Journal ArticleDOI

The real communication network behind the formal chart: Community structure in organizations

TL;DR: It is surmised that the exchange of e-mails between individuals in organizations reveals how people interact and therefore provides a map of the real network structure behind the formal chart.
Journal ArticleDOI

Finding local communities in protein networks

TL;DR: A tool, named Local Protein Community Finder, which quickly finds a community close to a queried protein in any network available from BioGRID or specified by the user, using two new local clustering algorithms Nibble and PageRank-Nibble, which look for a good cluster among the most popular destinations of a short random walk from the queried vertex.
References
More filters

疟原虫var基因转换速率变化导致抗原变异[英]/Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

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

Statistical mechanics of complex networks

TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.
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.
Journal ArticleDOI

Community structure in social and biological networks

TL;DR: This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Journal ArticleDOI

Finding and evaluating community structure in networks.

TL;DR: It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Related Papers (5)