更改

删除9字节 、 2020年10月25日 (日) 17:46
无编辑摘要
第174行: 第174行:  
This equation cannot be solved analytically, but can be graphed numerically. To summarize the important points, when gamma is large, the network acts as a random network, and attack robustness become similar to random failure robustness of a random network. However, when gamma is smaller, the critical threshold for attacks on scale-free networks becomes relatively small, indicating a weakness to targeted attacks.
 
This equation cannot be solved analytically, but can be graphed numerically. To summarize the important points, when gamma is large, the network acts as a random network, and attack robustness become similar to random failure robustness of a random network. However, when gamma is smaller, the critical threshold for attacks on scale-free networks becomes relatively small, indicating a weakness to targeted attacks.
   −
该方程无法解析求解,但可以用数字表示。从中得出的结论是,当伽马值''γ''很大时,该网络可近似看作随机网络,其对抗攻击的鲁棒性变得类似于随机网络的随机故障鲁棒性。但是,当''γ''较小时,针对无标度网络攻击的临界阈值将变得相对较小,其抵抗定向攻击的脆弱性质逐渐显现出来。
+
该方程无法解析求解,但可以用数字表示。从中得出的结论是,当''γ''很大时,该网络可近似看作随机网络,其对抗攻击的鲁棒性变得类似于随机网络的随机故障鲁棒性。但是,当''γ''较小时,针对无标度网络攻击的临界阈值将变得相对较小,其抵抗定向攻击的脆弱性质逐渐显现出来。
     
66

个编辑