Search research articles

Search research articles

Related Experiment Videos

Fast algorithm for detecting community structure in networks.

¹Department of Physics and Center for the Study of Complex Systems, University of Michigan, Ann Arbor, Michigan 48109-1120, USA.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics

|July 13, 2004

Summary

This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Mutual information and the encoding of contingency tables.

Physical review. E·2025

Same author

Luck, skill, and depth of competition in games and social hierarchies.

Science advances·2024

Same author

Hierarchical core-periphery structure in networks.

Physical review. E·2023

Same author

Clustering of heterogeneous populations of networks.

Physical review. E·2022

Same author

Reconstruction of plant-pollinator networks from observational data.

Nature communications·2021

Same author

Belief propagation for networks with loops.

Science advances·2021

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

A new, faster algorithm efficiently detects community structure in large networks. This computational method significantly outperforms previous approaches for analyzing complex network data.

Area of Science:

Network science
Computational complexity
Data analysis

Background:

Networks often exhibit community structure, characterized by dense internal connections and sparse inter-group links.
Existing algorithms for community detection are computationally intensive, restricting their use to smaller networks.

Purpose of the Study:

To introduce a novel, computationally efficient algorithm for detecting community structure in networks.
To demonstrate the algorithm's effectiveness on both synthetic and real-world network datasets.

Main Methods:

Development of a new algorithm for network community detection.
Testing the algorithm's performance and speed against established methods on diverse network types.

Main Results:

Related Experiment Videos

The new algorithm achieves excellent results in identifying community structure.
It is significantly faster, often thousands of times, than existing algorithms, enabling analysis of large-scale networks.

Conclusions:

The developed algorithm offers a scalable and efficient solution for community detection in large networks.
This advancement facilitates the analysis of complex systems, such as large collaboration networks.