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

Subgraph centrality in complex networks.

Ernesto Estrada1, Juan A Rodríguez-Velázquez

  • 1Complex Systems Research Group, X-Rays Unit, RIAIDT, Edificio CACTUS, University of Santiago de Compostela, 15706 Santiago de Compostela, Spain. estrada66@yahoo.com

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|August 11, 2005
PubMed
Summary

We developed subgraph centrality (C(S)(i)), a new network analysis measure that highlights node participation in smaller subgraphs. This method offers superior node discrimination and reveals key network structures, outperforming traditional centrality metrics.

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

Indirect social influence and diffusion of innovations: An experimental approach.

PNAS nexus·2024
Same author

What Is in a Simplicial Complex? A Metaplex-Based Approach to Its Structure and Dynamics.

Entropy (Basel, Switzerland)·2023
Same author

Network bypasses sustain complexity.

Proceedings of the National Academy of Sciences of the United States of America·2023
Same author

Topologically induced suppression of explosive synchronization.

Chaos (Woodbury, N.Y.)·2023
Same author

Nonuniform random graphs on the plane: A scaling study.

Physical review. E·2022
Same author

The world-wide waste web.

Nature communications·2022

Area of Science:

  • Network Science
  • Graph Theory
  • Computational Biology

Background:

  • Identifying critical nodes in complex networks is essential for understanding system behavior.
  • Existing centrality measures like degree, closeness, and betweenness have limitations in capturing nuanced node roles.

Purpose of the Study:

  • To introduce a novel centrality measure, subgraph centrality (C(S)(i)), that quantifies node participation across all network subgraphs.
  • To demonstrate the mathematical derivation and practical applicability of subgraph centrality.

Main Methods:

  • Developing subgraph centrality (C(S)(i)) by weighting participation in smaller subgraphs more heavily.
  • Deriving C(S)(i) from the spectral properties of a network's adjacency matrix.
  • Applying C(S)(i) to eight real-world networks, including a protein-protein interaction network.

Related Experiment Videos

Main Results:

  • Subgraph centrality (C(S)(i)) effectively discriminates nodes, outperforming traditional centrality measures.
  • C(S)(i) exhibits desirable properties in real-world networks, including clear node rankings and scale-free characteristics.
  • In yeast protein interaction networks, C(S)(i) ranking correlates better with protein lethality than simple node degree.

Conclusions:

  • Subgraph centrality (C(S)(i)) provides a powerful new tool for analyzing network structure and node importance.
  • The measure is particularly useful for identifying key components in biological networks and understanding functional roles.
  • C(S)(i) offers a more refined approach to network analysis compared to existing methods.