Effective resistance on graphs and the Epidemic quasimetric

Abstract

We introduce the epidemic quasimetric on graphs and study its behavior with respect to clustering techniques. In particular we compare its behavior to known objects such as the graph distance, effective resistance, and modulus of path families.

arXiv commentTypos corrected, to appear in Involve

References in corpus (1)

• Cooperative Game Theory Approaches for Network Partitioning

Cited by in corpus (1)

• Modulus on graphs as a generalization of standard graph theoretic quantities