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

Discovering Spatial Interaction Communities from Mobile Phone Data

TL;DR: An agglomerative clustering algorithm based on a Newman‐Girvan modularity metric and an alternative modularity function incorporating a gravity model are adopted and proposed to discover the clustering structures of spatial‐interaction communities using a mobile phone dataset from one week in a city in China.
Journal ArticleDOI

Toward a formalized account of attitudes: the Causal Attitude Network (CAN) model

TL;DR: The Causal Attitude Network (CAN) model is introduced, which conceptualizes attitudes as networks consisting of evaluative reactions and interactions between these reactions, and is argued that the CAN model provides a realistic formalized measurement model of attitudes and therefore fills a crucial gap in the attitude literature.
Journal ArticleDOI

Global energy flows embodied in international trade: A combination of environmentally extended input–output analysis and complex network analysis

TL;DR: In this paper, the authors apply a variety of complex network analysis tools to uncover the structure of embodied energy flow network (EEFN) at global, regional and national level, based on environmentally extended input-output analysis (EEIOA).
Journal ArticleDOI

Exploring local community structures in large networks

TL;DR: This paper extends the concept of degree from single vertex to sub-graph, and presents a formal definition of module/community in a network based on this extension, and implements a JAVA tool, MoNet, for exploring local community structures in large networks.
Journal ArticleDOI

Correlation based networks of equity returns sampled at different time horizons

TL;DR: In this paper, the authors investigate the planar maximally filtered graphs of the portfolio of the 300 most capitalized stocks traded at the New York Stock Exchange during the time period 2001-2003.
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)