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

Near linear time algorithm to detect community structures in large-scale networks.

Usha Nandini Raghavan1, Réka Albert, Soundar Kumara

  • 1Department of Industrial Engineering, The Pennsylvania State University, University Park, Pennsylvania 16802, USA.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|October 13, 2007
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

Succession-diagram-based Markov chains reveal the attractor landscape of asynchronous Boolean networks.

NPJ systems biology and applications·2026
Same author

Predicting Metabolic Dysfunction-Associated Steatotic Liver Disease using Machine Learning Methods: A Retrospective Cohort Study.

ArXiv·2026
Same author

A Protein Interactome-Based Framework Reveals the General Toxicity of Chemicals.

Environmental science & technology·2025
Same author

Suppressing Symptomless Nonhost Resistance of Barley to <i>Tobacco mosaic virus</i> by Short-Term Heat Stress-Role of Superoxide in Resistance.

Plants (Basel, Switzerland)·2025
Same author

Automated model refinement using perturbation-observation pairs.

NPJ systems biology and applications·2025
Same author

An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks?

Journal of mathematical biology·2025
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

A new label propagation algorithm efficiently detects communities in large networks using only network structure. This method avoids prior information and is computationally inexpensive for network analysis.

Area of Science:

  • Network Science
  • Computational Social Science
  • Computational Biology

Background:

  • Community detection is crucial for understanding complex network organization.
  • Existing algorithms often require prior community information or are computationally intensive.
  • Applications span social consensus formation to biochemical network analysis.

Purpose of the Study:

  • To introduce a novel, efficient label propagation algorithm for community detection.
  • To address the limitations of existing computationally expensive and information-dependent methods.
  • To provide a scalable solution for analyzing large-scale real-world networks.

Main Methods:

  • Nodes are initialized with unique labels.
  • Each node iteratively adopts the majority label of its neighbors.

Related Experiment Videos

  • Densely connected nodes converge to a consensus label, forming communities.

    • Main Results:

    • The algorithm successfully identifies community structures in known networks.
    • It requires no prior information on the number or size of communities.
    • The method demonstrates near-linear time complexity, indicating computational efficiency.

    Conclusions:

    • The label propagation algorithm offers an efficient and scalable approach to community detection.
    • It simplifies network analysis by relying solely on network topology.
    • This method presents a computationally advantageous alternative for large-scale network studies.