基于优化技术的复杂网络拓扑变化下的边界鲁棒性
Bounding robustness in complex networks under topological changes through majorization techniques
摘要:
鲁棒性度量是分析复杂网络结构的一项基本任务。事实上,已经提出了几种捕获网络鲁棒性的方法。在本文中,我们专注于频谱图论的鲁棒性是衡量通过一个图形不变称为基尔霍夫指数,表示在拉普拉斯矩阵的特征值相关的图形。该图度量作为可以建模为图的几个现实世界网络的鲁棒性指标具有高度的信息性。我们讨论了一种方法,旨在获得一些新的和更严格的界限,这个图不变的链接时,添加或删除。我们利用实分析技术,基于优化理论和优化的功能,保持优化序(Schurconvex函数)。模拟图的应用程序显示了我们的界限的有效性,也在文献中获得的结果提供有意义的见解。
英文摘要:
Measuring robustness is a fundamental task for analyzing the structure of complex networks. Indeed, several approaches to capture the robustness properties of a network have been proposed. In this paper we focus on spectral graph theory where robustness is measured by means of a graph invariant called Kirchhoff index, expressed in terms of eigenvalues of the Laplacian matrix associated to a graph. This graph metric is highly informative as a robustness indicator for several realworld networks that can be modeled as graphs. We discuss a methodology aimed at obtaining some new and tighter bounds of this graph invariant when links are added or removed. We take advantage of real analysis techniques, based on majorization theory and optimization of functions which preserve the majorization order (Schurconvex functions). Applications to simulated graphs show the effectiveness of our bounds, also in providing meaningful insights with respect to the results obtained in the literature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。