minimum-spanning-tree

This paper develops an ℓ0-type stability theory for subdominant (minmax) ultrametrics, proving that sparse edits propagate only through the minimum spanning tree and deriving Hamming–Lipschitz bounds on changed ultrametric entries. Experiments on deep-embedding graphs and clustering tasks demonstrate the utility of the resulting structural scores as vulnerability diagnostics.