【摘要】 传统关键节点识别算法仅考虑一种关系,无法表示实际网络中节点间存在多种关系相互影响的特性。因此,本文基于多子网复合复杂网络,提出引入多关系的MCCN-Degree算法识别关键节点。根据多子网复合复杂网络理论构建山东省青岛市公共交通复合网,应用传统关键节点识别算法和MCCN-Degree算法分别对网络中节点重要性进行分析,研究节点被攻击时的网络鲁棒性,进而验证算法效果。研究结果表明:MCCN-Degree算法识别的节点被攻击时更容易使网络鲁棒性降低,有效提高了识别的准确性;节点重要性排序受节点间多关系比例影响。更多还原

【Abstract】 The traditional key node identification algorithm only considers one relationship, which can not represent the characteristics of multiple relationships among nodes in the actual network. Therefore, based on multi subnet composite complex network, this paper proposes a MCCN degree algorithm with multi relationship to identify key nodes. According to the theory of multi subnet composite complex network, the public transport composite network in Qingdao, Shandong Province is constructed. The traditional key node identification algorithm and MCCN degree algorithm are used to analyze the importance of nodes in the network,study the network robustness when nodes are attacked, and then verify the effect of the algorithm. The results show that when the nodes identified by MCCN degree algorithm are attacked, it is easier to reduce the network robustness and effectively improve the accuracy of identification; The ranking of node importance is affected by the proportion of multiple relationships between nodes.更多还原