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

The Prince and the Pauper: Search and Brokerage in the Initiation of Status-Heterophilous Ties

TL;DR: This work examines how a brokerage position coupled with aspiration--performance gaps affects an organization's propensity to initiate ties to partners of different status, and suggests that organizations in brokerage positions set social and historical aspiration levels differently from nonbrokers, levels that affect decisions about partner selection.
Journal ArticleDOI

Estimating the Number of Communities in a Network.

TL;DR: A mathematically principled approach for finding the number of communities in a network by maximizing the integrated likelihood of the observed network structure under an appropriate generative model is described.
Book ChapterDOI

Structural properties of scale‐free networks

TL;DR: The structural properties of scale-free networks are studied and it is shown that in the regime 2 < < 3 the networks are resilient to random breakdown and the percolation transition occurs only in the limit of extreme dilution.
Journal ArticleDOI

Communities, knowledge creation, and information diffusion

TL;DR: It is shown that highly cited scientific production occurs within communities, when scientists have cohesive collaborations with others from the same knowledge domain, and across communities,When scientists intermediate among otherwise disconnected collaborators from different knowledge domains.
Dissertation

Online social networks: measurement, analysis, and applications to distributed information systems

TL;DR: This thesis conducts the first large-scale measurement study of multiple online social networks at scale, capturing information about over 50 million users and 400 million links, and identifies a common structure across multiple networks, characterizes the underlying processes that are shaping the network structure, and exposes the rich community structure.
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)