Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Finding and evaluating community structure in networks.

M E J Newman1, M Girvan

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

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|March 5, 2004
PubMed
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

Hybridizing traditional and next-generation reservoir computing to accurately and efficiently forecast dynamical systems.

Chaos (Woodbury, N.Y.)·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 journal

Tension on dsDNA bound to ssDNA-RecA filaments may play an important role in driving efficient and accurate homology recognition and strand exchange.

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Amplitude-phase coupling drives chimera states in globally coupled laser networks [Phys. Rev. E 91, 040901(R) (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Shapes of sedimenting soft elastic capsules in a viscous fluid [Phys. Rev. E 92, 033003 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Attenuation of excitation decay rate due to collective effect [Phys. Rev. E 90, 022142 (2014)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Role of connectivity and fluctuations in the nucleation of calcium waves in cardiac cells [Phys. Rev. E 92, 052715 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Lattice Boltzmann approach for complex nonequilibrium flows [Phys. Rev. E 92, 043308 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
See all related articles

This study introduces novel algorithms for network community detection. These methods iteratively remove edges based on recalculated betweenness measures to reveal densely connected subgroups in complex networks.

Area of Science:

  • Network Science
  • Computer Science
  • Data Analysis

Background:

  • Networks are ubiquitous, from social systems to biological pathways.
  • Understanding community structure is key to analyzing network behavior.
  • Existing methods may struggle with dynamic or large-scale networks.

Purpose of the Study:

  • To develop and evaluate new algorithms for discovering community structure in networks.
  • To introduce a metric for quantifying the strength of detected community structures.
  • To demonstrate the algorithms' effectiveness on diverse network datasets.

Main Methods:

  • Iterative edge removal based on betweenness centrality.
  • Recalculation of betweenness measures after each edge removal.

Related Experiment Videos

  • Development of a community structure strength metric.
  • Main Results:

    • Algorithms effectively identify densely connected subgroups (communities).
    • Demonstrated high performance on both synthetic and real-world network data.
    • The proposed strength metric objectively determines the optimal number of communities.

    Conclusions:

    • The novel algorithms provide a robust approach to network community detection.
    • These methods offer insights into the organization of complex networked systems.
    • The approach is applicable to various domains requiring network analysis.