网络最大组件的节点移除漏洞
Node Removal Vulnerability of the Largest Component of a Network
摘要:
网络的连通性结构可能对网络中某些节点的移除非常敏感。在本文中,我们研究的最大组件的大小节点删除的敏感性。我们证明,最大组件的大小最小化是相当于解决一个矩阵的一个范数最小化问题,其列向量是正交的和稀疏的,它们形成了相关的图拉普拉斯矩阵的零空间的基础。然后提出了一种基于矩阵一范数最小化的贪婪节点去除算法。在美国电网数据集上的实验结果表明,与其他节点中心度(如节点度和介数)相比,该方法能够以相对较少的节点删除量减少最大分量的大小,从而验证了该方法的有效性.
英文摘要:
The connectivity structure of a network can be very sensitive to removal of certain nodes in the network. In this paper, we study the sensitivity of the largest component size to node removals. We prove that minimizing the largest component size is equivalent to solving a matrix one-norm minimization problem whose column vectors are orthogonal and sparse and they form a basis of the null space of the associated graph Laplacian matrix. A greedy node removal algorithm is then proposed based on the matrix one-norm minimization. In comparison with other node centralities such as node degree and betweenness, experimental results on US power grid dataset validate the effectiveness of the proposed approach in terms of reduction of the largest component size with relatively few node removals.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。