Introducing Total Harmonic Resistance for Graph Robustness under Edge Deletions
Lukas Berner, Henning Meyerhenke

TL;DR
This paper introduces total harmonic resistance as a new robustness measure for graphs, especially under edge deletions, and demonstrates its advantages over existing measures through theoretical analysis and practical case studies.
Contribution
The paper proposes total harmonic resistance as a novel robustness measure that handles disconnected graphs and prioritizes central edges, improving upon existing measures like the forest index.
Findings
Total harmonic resistance prioritizes central edges for robustness.
The new measure performs better in case studies on real and benchmark graphs.
The greedy algorithm effectively optimizes the robustness measure.
Abstract
Assessing and improving the robustness of a graph are critical steps in network design and analysis. To this end, we consider the optimisation problem of removing edges from such that the resulting graph has minimal robustness, simulating attacks or failures. In this paper, we propose total harmonic resistance as a new robustness measure for this purpose - and compare it to the recently proposed forest index [Zhu et al., IEEE Trans.\ Inf.\ Forensics and Security, 2023]. Both measures are related to the established total effective resistance measure, but their advantage is that they can handle disconnected graphs. This is also important for originally connected graphs due to the removal of the edges. To compare our measure with the forest index, we first investigate exact solutions for small examples. The best edges to select when optimizing for the forest index lie…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks
