College of Information System and Management, National University of Defense Technology, Changsha, Hunan, 410073, P. R. China.
Sci Rep. 2017 Aug 8;7(1):7559. doi: 10.1038/s41598-017-07878-2.
Many real-world systems can be described by scale-free networks with power-law degree distributions. Scale-free networks show a "robust yet fragile" feature due to their heterogeneous degree distributions. We propose to enhance the structural robustness of scale-free networks against intentional attacks by changing the displayed network structure information rather than modifying the network structure itself. We first introduce a simple mathematical model for attack information and investigate the impact of attack information on the structural robustness of scale-free networks. Both analytical and numerical results show that decreasing slightly the attack information perfection by information disturbance can dramatically enhance the structural robustness of scale-free networks. Then we propose an optimization model of disturbance strategies in which the cost constraint is considered. We analyze the optimal disturbance strategies and show an interesting but counterintuitive finding that disturbing "poor nodes" with low degrees preferentially is more effective than disturbing "rich nodes" with high degrees preferentially. We demonstrate the efficiency of our method by comparison with edge addition method and validate the feasibility of our method in two real-world critical infrastructure networks.
许多真实世界的系统可以用具有幂律度分布的无标度网络来描述。由于其异质的度分布，无标度网络表现出一种“稳健但脆弱”的特性。我们提出通过改变显示的网络结构信息而不是修改网络结构本身来增强无标度网络对故意攻击的结构鲁棒性。我们首先引入了一个简单的攻击信息数学模型，并研究了攻击信息对无标度网络结构鲁棒性的影响。分析和数值结果都表明，通过信息干扰稍微降低攻击信息的完美性，可以显著提高无标度网络的结构鲁棒性。然后，我们提出了一种考虑代价约束的干扰策略优化模型。我们分析了最优干扰策略，并发现了一个有趣但违反直觉的结果，即优先干扰低度数的“贫困节点”比优先干扰高度数的“富裕节点”更有效。我们通过与边添加方法的比较证明了我们方法的效率，并在两个真实的关键基础设施网络中验证了我们方法的可行性。
