Related Experiment Video
Updated: Jul 6, 2026

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
Published on: September 25, 2021
Transitive closure and metric inequality of weighted graphs: detecting protein interaction modules using cliques
Chris Ding1, Xiaofeng He, Hui Xiong
1Lawrence Berkeley National Laboratory, University of California, Berkeley, CA 94720, USA. chqding@lbl.gov
Abstract:
We study transitivity properties of edge weights in complex networks. We show that enforcing transitivity leads to a transitivity inequality which is equivalent to ultra-metric inequality. This can be used to define transitive closure on weighted undirected graphs, which can be computed using a modified Floyd-Warshall algorithm. These new concepts are extended to dissimilarity graphs and triangle inequalities. From this, we extend the clique concept from unweighted graph to weighted graph. We outline several applications and present results of detecting protein functional modules in a protein interaction network.
Related Concept Videos
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Protein-protein Interfaces
Protein-Protein Interfaces
Ligand Binding and Linkage
Ligand Binding and Linkage
