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

Spectral methods cluster words of the same class in a syntactic dependency network

TL;DR: This work focuses on a particular kind of linguistic network where vertices represent words and edges stand for syntactic relationships between words, and shows that the ordering clusters words of the same class.
Journal ArticleDOI

A multi-objective bat algorithm for community detection on dynamic social networks

TL;DR: A novel multi-objective Bat Algorithm that uses Mean Shift algorithm to generate the initial population, to obtain solutions of high quality and simultaneously optimizes the modularity density and the normalized mutual information of the solutions as objective functions is proposed.
Proceedings ArticleDOI

An automatic extraction approach: transition to microservices architecture from monolithic application

TL;DR: This paper proposes a new approach to transform existing applications into microservices using code repositories using evolutionary and static code coupling information, and the graph clustering methodology, in order to automatically extract microservices from monoliths.
Journal Article

Detecting Community Structure in Amino Acid Interaction Networks

TL;DR: This paper introduces the notion of protein interaction network, a graph whose vertices are the protein’s amino acids and whose edges are the interactions between them and observes that according to their structural roles, the nodes interact differently.
Journal ArticleDOI

Forensic analysis of phone call networks

TL;DR: This paper presents LogAnalysis, a tool developed to provide visual data representation and filtering, statistical analysis features and the possibility of a temporal analysis of mobile phone activities, and puts into evidence how the adoption of LogAnalysis may be crucial to solve real cases.
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)