Critical nodes identification in complex systems
Critical nodes identification in complex systems
复制标题
DOI：
10.1007/s40747-016-0006-8
复制
发表时间：
2015-12-01
影响因子：
5.8
通讯作者：
Chen, Xin
中科院分区：
文献类型：
--
作者：
Chen, Xin
为了控制资源有限的复杂系统，需要识别关键节点以进行保护或删除。关键节点的丢失会降低或最小化系统传播信息、商品或疾病等实体的能力。我们设计了三个指标来评估系统的同质性，扩散速度和扩散规模，并研究其在复杂系统中的性能。六个算法使用的三个指标，以确定关键节点进行检查。三个非多项式时间算法确定最关键的节点（全局最优）。这三种多项式时间算法逐步确定关键节点（局部最优），但不能保证全局最优。与其他关键节点识别算法相比，这三种多项式时间算法具有更好的性能，可应用于实际问题中，有效地识别复杂系统中的关键节点。
To control complex systems with limited resources, critical nodes need to be identified for protection or removal. Loss of critical nodes decreases or minimizes a system's ability to diffuse entities such as information, goods, or diseases. We design three metrics to assess system homogeneity, diffusion speed, and diffusion scale, and investigate their performance over complex systems. Six algorithms using the three metrics to identify critical nodes are examined. The three nonpolynomial-time algorithms identify the most critical nodes (global optimum). The three polynomial-time algorithms identify critical nodes step by step (local optima), but do not guarantee the global optimum. The three polynomial-time algorithms are compared to other critical nodes identification algorithms and have better performance; they may be applied to practical problems to efficiently identify critical nodes in complex systems.