Why the Metric Backbone Preserves Community Structure

Maximilien Dreveton, Charbel Chucri, Matthias Grossglauser +1

The metric backbone of a weighted graph is the union of all-pairs shortest paths. It is obtained by removing all edges $(u,v)$ that are not the shortest path between $u$ and $v$. I…