基于全局和局部边插入的抗阻性图鲁棒性贪心优化
Greedy Optimization of Resistance-based Graph Robustness with Global and Local Edge Insertions
AI总结:
研究通过添加边最小化图的总有效电阻以提升鲁棒性,提出利用组合与代数连接加速贪心算法增益计算,并引入子采样提升性能,显著快于现有方法且能处理更大图。
摘要:
总有效电阻,也称为基尔霍夫指数,为图$G$提供了一种鲁棒性度量。我们考虑两个优化问题:向$G$添加$k$条新边,使得生成的图具有最小的总有效电阻(即最鲁棒)——一种情况是新边可以在图中的任何位置,另一种情况是新边需要与指定的焦点节点关联。总有效电阻和节点间的有效电阻可以通过图拉普拉斯矩阵的伪逆来计算。伪逆可以通过伪逆运算显式计算;然而,这在实践中需要立方时间,在空间上需要平方级。我们转而利用组合和代数连接来加速已建立的通用贪心启发式算法中的增益计算。此外,我们通过引入子采样步骤,利用现有的随机化技术来提升我们方法的性能。我们不同的基于图和矩阵的方法确实比最先进的贪心算法快得多,同时其质量仍然相当高,并且通常非常接近。我们的实验表明,我们现在可以处理更大的图,而之前应用最先进的贪心方法在这些图上是不切实际的。
英文摘要:
The 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。