Core Concepts
The ultrametric backbone is the union of all minimum spanning forests, providing a new generalization of minimum spanning trees to directed graphs.
Abstract
This article discusses the concept of the ultrametric backbone as a subgraph formed by edges that obey a generalized triangle inequality. It contrasts with minimum spanning trees and forests, offering a new approach for preserving shortest paths and De Morgan's law consistency. The content is structured into sections covering Introduction, Results for Undirected Graphs, Results for Directed Graphs, Discussion, Acknowledgments, Conflicts of Interest, and Appendices detailing distance closures and notations used.
Introduction and Background:
Minimum spanning trees are essential in network science.
Different edge weight aggregation methods determine path lengths.
Distance closure framework quantifies node-to-node distances in weighted graphs.
Results - Undirected Graphs:
Ultrametric backbone equals the union of minimal spanning forests.
Lemmas establish relationships between MSTs and ultrametric backbones.
Results - Directed Graphs:
Theorem 2.4 does not generalize to directed graphs.
Counterexamples demonstrate differences from traditional constructions.
Discussion:
Ultrametric backbone extends MST concept to directed graphs uniquely.
Offers computational advantages over traditional approaches in certain scenarios.
Appendices:
Definitions of T-norms, T-conorms, proximity structures, TD-norms, TD-conorms, distance structures provided.
Notation summary table included for reference.
Stats
The ultrametric backbone is the union of all minimum spanning forests in undriected graphs.
Applying this operator yields the ultrametric backbone of a graph in that (semi-triangular) edges whose weights are larger than the length of an indirect path connecting the same nodes (i.e., those that break the generalized triangle inequality based on max as a path-length operator) are removed.
Quotes
"The ultrametric backbone removes an edge if its endpoints are connected by a path composed of smaller edges."
"Neither subgraph is equal to the metric or ultrametric backbone."