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

Vertex similarity in networks.

E A Leicht1, Petter Holme, M E J Newman

  • 1Department of Physics, University of Michigan, Ann Arbor, Michigan 48109, USA.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|April 12, 2006
PubMed
Summary

We introduce a novel network vertex similarity measure. This method quantifies vertex similarity based on the similarity of their neighbors, using an iterative matrix approach validated on synthetic and real-world networks.

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

Community structure unveils the path multiplicity in complex networks.

Nature communications·2026
Same author

Social networking agency and prosociality are inextricably linked in economic games.

Nature human behaviour·2025
Same author

Navigation on temporal networks.

Applied network science·2025
Same author

Mutual information and the encoding of contingency tables.

Physical review. E·2025
Same author

Postdoc publications and citations link to academic retention and faculty success.

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

Beyond a binary theorizing of prosociality.

Proceedings of the National Academy of Sciences of the United States of America·2024

Area of Science:

  • Graph theory
  • Network analysis
  • Data science

Background:

  • Quantifying vertex similarity is crucial for understanding network structure and function.
  • Existing methods may not fully capture nuanced relationships within complex networks.

Purpose of the Study:

  • To propose and validate a new iterative method for quantifying vertex similarity in networks.
  • To establish a self-consistent matrix formulation for network vertex similarity.

Main Methods:

  • Developed a similarity measure where vertex similarity is defined by the similarity of their immediate neighbors.
  • Formulated the similarity measure as a self-consistent matrix equation.
  • Employed iterative evaluation using only the network's adjacency matrix.

Main Results:

  • The proposed similarity measure was tested on computer-generated networks with known outcomes.
  • The method was also applied to various real-world network datasets.
  • Demonstrated the effectiveness and applicability of the iterative similarity quantification.

Conclusions:

  • The proposed iterative matrix-based approach provides a robust method for quantifying network vertex similarity.
  • This technique offers a valuable tool for network analysis and understanding complex systems.

Related Experiment Videos