关键词: 关键词：排序算法, 大规模网络, 共同邻居数, SIR模型

Abstract:
Abstract： Identifying important nodes has always been one of the hot problems under complex networks， because the identified important nodes can play an important role in information dissemination or disease immunization in the population. The research of large number of current methods is basically based on three perspectives： node’s neighbor information， shortest path in the network and node deletion. The existing approaches based on the node’s neighbor information do not provide a specific description of the role of neighboring nodes and do not differentiate the contributions of neighboring nodes in different dimensions. This paper proposes a SCCN method， this method divides the contribution of neighbor nodes into two parts： strengthening the propagation effect within the tightly connected local area where the node is located and extending the information carried by the node to other areas of the network. The performance of SCCN is evaluated by the standard SIR model and compared with degree centrality， K-shell， meso-centrality and PageRank on eight real networks. The experimental results show that SCCN has higher accuracy and stability， as well as lower time complexity， and can be applied to large-scale networks.

Key words: Key words： ranking algorithm, large-scale network, common neighbors, SIR model