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

Analysis of weighted networks.

M E J Newman1

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

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|December 17, 2004
PubMed
Summary

Analyzing weighted networks is simplified by mapping them to unweighted multigraphs. This approach allows standard graph techniques to be applied to weighted networks, aiding community detection and proving theorems.

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

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 author

Belief propagation for networks with loops.

Science advances·2021

Area of Science:

  • Network Science
  • Graph Theory
  • Data Analysis

Background:

  • Many real-world networks possess weighted connections, reflecting varying interaction strengths.
  • Weighted networks are often considered more complex and difficult to analyze than unweighted networks.
  • Existing network analysis methods predominantly focus on unweighted graph structures.

Purpose of the Study:

  • To introduce a straightforward method for analyzing weighted networks.
  • To demonstrate the applicability of unweighted graph techniques to weighted network analysis.
  • To facilitate the study of complex systems with weighted interconnections.

Main Methods:

  • Developed a mapping technique to transform weighted networks into unweighted multigraphs.
  • Applied standard graph algorithms to the transformed unweighted multigraph representations.
  • Utilized the mapping to prove the maximum-flow minimum-cut theorem.

Main Results:

  • Established a general method for analyzing weighted networks using unweighted graph techniques.
  • Successfully applied the method to detect community structure in weighted networks.
  • Provided a simplified proof for the maximum-flow minimum-cut theorem using the proposed mapping.

Conclusions:

  • Weighted networks can be effectively analyzed by converting them into unweighted multigraphs.
  • This transformation simplifies complex network analysis and broadens the applicability of existing algorithms.
  • The method offers a powerful tool for understanding network structures and fundamental network theorems.

Related Experiment Videos