基于网络结构和信息传播的节点重要性识别方法

节点重要性评估是复杂网络研究的重要问题，对研究复杂网络的脆弱性和鲁棒性具有重要意义。通过考虑网络拓扑结构和信息传播，对局部网络间的拓扑结构进行量化，提出一种考虑节点度以及邻居节点的结构相似性的节点重要度评估LSC算法。基于6个经典实际网络和两个人工网络，以蓄意破坏的方式对网络进行攻击，通过极大联通系数、网络效率和网络节点单调性3个评估指标的实验结果对比，证明所提算法LSC相比于其他已有算法更能准确地评估网络节点的重要性。

Node Importance Identification Method Based on Network Structure and Information Dissemination

Node importance assessment is an important issue in complex network research, and it is important to study the vulnerability and robustness of complex networks. By considering the network topology and information dissemination, and quantifying the topology among local networks, a node importance evaluation LSC algorithm that considers the degree of nodes and the structural similarity of neighbor nodes was presented. Based on six classical real networks and two man-made networks, the network is attacked by means of intentional destruction. The experimental results of three evaluation indicators, i.e., maximum connectivity factor, network efficiency and network monotonicity, show that the proposed algorithm LSC can more accurately evaluate the importance of network nodes than other existing algorithms.