Author:
Predari Maria,Berner Lukas,Kooij Robert,Meyerhenke Henning
Abstract
AbstractThe total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph G. We consider two optimization problems of adding k new edges to G such that the resulting graph has minimal total effective resistance (i.e., is most robust)—one where the new edges can be anywhere in the graph and one where the new edges need to be incident to a specified focus node. The total effective resistance and effective resistances between nodes can be computed using the pseudoinverse of the graph Laplacian. The pseudoinverse may be computed explicitly via pseudoinversion, yet this takes cubic time in practice and quadratic space. We instead exploit combinatorial and algebraic connections to speed up gain computations in an established generic greedy heuristic. Moreover, we leverage existing randomized techniques to boost the performance of our approaches by introducing a sub-sampling step. Our different graph- and matrix-based approaches are indeed significantly faster than the state-of-the-art greedy algorithm, while their quality remains reasonably high and is often quite close. Our experiments show that we can now process larger graphs for which the application of the state-of-the-art greedy approach was impractical before.
Funder
Deutsche Forschungsgemeinschaft
TU Delft Safety & Security Institute
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Human-Computer Interaction,Media Technology,Communication,Information Systems
Reference73 articles.
1. Achlioptas D (2003) Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J Comput Syst Sci 66(4):671–687
2. Angriman E, Becker R, D’Angelo G, Gilbert H, van der Grinten A, Meyerhenke H (2021) Group-harmonic and group-closeness maximization - approximation and engineering. In: Proc of the Symp on Algorithm Engineering and Experiments, ALENEX, 2021. SIAM, pp 154–168
3. Angriman E, Predari M, van der Grinten A, Meyerhenke H (2020) Approximation of the diagonal of a Laplacian’s pseudoinverse for complex network analysis. In: ESA 2020, Italy, vol 173, pp 6:1–6:24
4. Angriman E, van der Grinten A, von Looz M, Meyerhenke H, Nöllenburg M, Predari M, Tzovas C (2019) Guidelines for experimental algorithmics: a case study in network analysis. Algorithms 12(7):127
5. Avena L, Castell F, Gaudillière A, Mélot C (2018) Random forests and networks analysis. J Stat Phys 173:985–1027