更改

The perfect degree correlation means that each degree-k node is connected only to the same degree-k nodes. Such connectivity of nodes decide the topology of networks, which has an effect on robustness of network, the attribute discussed above. If the number of links between the hubs is the same as would be expected by chance, we refer to this network as Neutral Network. If hubs tend to connected to each other while avoiding linking to small-degree nodes we refer to this network as Assortative Network. This network is relatively resistant against attacks, because hubs form a core group, which is more reduntant against hub removal. If hubs avoid connecting to each other while linking to small-degree nodes, we refer to this network as Disassortative Network. This network has a hub-and-spoke character. Therefore, if we remove the hub in this type of network, it may damage or destroy the whole network.

The perfect degree correlation means that each degree-k node is connected only to the same degree-k nodes. Such connectivity of nodes decide the topology of networks, which has an effect on robustness of network, the attribute discussed above. If the number of links between the hubs is the same as would be expected by chance, we refer to this network as Neutral Network. If hubs tend to connected to each other while avoiding linking to small-degree nodes we refer to this network as Assortative Network. This network is relatively resistant against attacks, because hubs form a core group, which is more reduntant against hub removal. If hubs avoid connecting to each other while linking to small-degree nodes, we refer to this network as Disassortative Network. This network has a hub-and-spoke character. Therefore, if we remove the hub in this type of network, it may damage or destroy the whole network.

'''<font color="#ff8000">完全度相关 Perfect Degree Correlation</font>'''意味着每个度值为k的节点只连接到相同度值的节点。节点之间的这种连通性决定了网络的拓扑结构，从而影响了网络的鲁棒性。如果枢纽节点之间的链接数量与偶然预期的相同，我们将这个网络称为'''<font color="#ff8000">中性网络 Neutral Network</font>'''。如果枢纽节点倾向于相互连接，同时避免链接到小度的节点，我们将这个网络称为'''<font color="#ff8000">选型网络 Assortative Network</font>'''。这个网络抵抗攻击的能力相对较强，因为枢纽节点形成了一个核心组，这对枢纽节点的移除来说是更加冗余的。如果枢纽节点避免相互连接，同时连接到小度的节点，我们将这个网络称为'''<font color="#ff8000">非选型网络 Disassortative Network</font>'''。这个网络具有'''<font color="#ff8000">中心辐射特征 Hub-and-Spoke Character</font>'''。因此，如果我们删除这种类型网络中的枢纽节点，可能会破坏或摧毁整个网络。

'''<font color="#ff8000">完全度相关 Perfect Degree Correlation</font>'''意味着每个度值为k的节点只连接到相同度值的节点。节点之间的这种链接决定了网络的拓扑结构，从而影响了上文所讨论的网络鲁棒性。如果枢纽之间的链接数量与随机模式下的期望值相同，我们将这个网络称为'''<font color="#ff8000">中性网络 Neutral Network</font>'''。如果枢纽倾向于相互连接，同时避免链接到小度节点，我们将这个网络称为'''<font color="#ff8000">同配网络 Assortative Network</font>'''。这种网络的抗毁性相对较强，因为枢纽形成了一个核心团体，这对枢纽的移除来说是更加冗余的。如果枢纽避免相互链接，同时链接到小度节点，我们将这个网络称为'''<font color="#ff8000">异配网络 Disassortative Network</font>'''。这种网络具有'''<font color="#ff8000">中心辐射特征 Hub-and-Spoke Character</font>'''。因此，如果我们删除这种类型网络中的枢纽，可能会破坏或摧毁整个网络。

 

 

==='''<font color="#ff8000">传播效应 Spreading phenomenon</font>'''  ===

==='''<font color="#ff8000">传播效应 Spreading phenomenon</font>'''  ===