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

Defining and identifying communities in networks.

Filippo Radicchi1, Claudio Castellano, Federico Cecconi

  • 1Dipartimento di Fisica, Università di Roma Tor Vergata, Via della Ricerca Scientifica 1, 00133 Rome, Italy.

Proceedings of the National Academy of Sciences of the United States of America
|February 26, 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

Functional and clinical outcomes of propeller flaps in lower extremity reconstruction: A systematic review.

JPRAS open·2026
Same author

Scale invariance and statistical significance in complex weighted networks.

Physical review. E·2026
Same author

Detectability threshold in weighted modular networks.

Physical review. E·2026
Same author

Shortest-path percolation on scale-free networks.

Physical review. E·2026
Same author

Triadic percolation on multilayer networks.

Physical review. E·2026
Same author

Skin Cancers in People Living with Human Immunodeficiency Virus (HIV) Infection.

Journal of clinical medicine·2025

This study introduces a new local algorithm for network community detection, offering a quantitative definition for self-contained analysis. It efficiently identifies communities in large networks, outperforming existing methods.

Area of Science:

  • Network science
  • Computational biology
  • Social network analysis

Background:

  • Community structure detection is crucial across diverse fields like social networks, biology, and technology.
  • Existing algorithms lack a universal quantitative community definition, hindering result interpretation.
  • There's a need for efficient and self-contained methods for community identification.

Purpose of the Study:

  • To implement quantitative definitions of community structure within existing algorithms.
  • To propose a novel local algorithm for community detection.
  • To enhance the reliability and computational efficiency of community identification.

Main Methods:

  • Analysis of existing community detection algorithms and their quantitative definitions.

Related Experiment Videos

  • Development and implementation of a local community detection algorithm.
  • Testing the algorithm on artificial and real-world network datasets, including a large scientific collaboration network.

    • Main Results:

    • Demonstrated how quantitative definitions can make community detection algorithms self-contained.
    • The proposed local algorithm shows superior computational efficiency compared to existing methods.
    • The algorithm successfully applied to large-scale networks intractable for traditional approaches.

    Conclusions:

    • Quantitative definitions enhance the interpretability and self-sufficiency of community detection algorithms.
    • The novel local algorithm provides a reliable and computationally efficient solution for identifying communities.
    • This approach has significant potential for analyzing large technological and biological networks.