更改

在'''<font color="#ff8000">网络科学 Network Science</font>'''中，'''<font color="#ff8000">枢纽节点 Hub</font>'''是链接数大大超过平均值的节点。枢纽节点是'''<font color="#ff8000">无标度网络 Scale-Free Property of Networks</font>'''的重要特性。虽然在随机网络中不存在枢纽节点，但是它们却存在于无标度网络中。无标度网络中枢纽节点的涌现与'''<font color="#ff8000">幂律分布 Power-Law Distribution</font>'''有关，其对网络的拓扑结构有着重要的影响。枢纽节点可以在很多真实的网络中找到，比如大脑网络或者互联网。

在'''<font color="#ff8000">网络科学 Network Science</font>'''中，'''<font color="#ff8000">枢纽节点 Hub</font>'''是链接数大大超过平均值的节点。枢纽节点是'''<font color="#ff8000">无标度网络 Scale-Free Property of Networks</font>'''的重要特性。虽然在随机网络中不存在枢纽节点，但是它们却存在于无标度网络中。无标度网络中枢纽节点的涌现与'''<font color="#ff8000">幂律分布 Power-Law Distribution</font>'''有关，其对网络的拓扑结构有着重要的影响。枢纽节点可以在很多真实的网络中找到，比如大脑网络或者互联网。

[[File:Network representation of brain connectivity.JPG|thumb|

[[File:Network representation of brain connectivity.JPG|thumb|right|

图1：Network representation of brain connectivity. Hubs are highlighted|150px|right] 表示大脑连接性的网络，其中枢纽节点被突出显示]]

图1：Network representation of brain connectivity. Hubs are highlighted 表示大脑连接性的网络，其中枢纽节点被突出显示]]

[[File:Internet map 4096.png|thumb|Partial map of the Internet based on the January 15, 2005. Hubs are highlighted|150px|right]

[[File:Internet map 4096.png|thumb|150px|right|

图2:2005年1月15日的因特网局部图，枢纽节点被突出显示]]

图2:Partial map of the Internet based on the January 15, 2005. Hubs are highlighted 2005年1月15日的因特网局部图，枢纽节点被突出显示]]

A hub is a component of a network with a high-degree [[Vertex (graph theory)|node]]. Hubs have a significantly larger number of links in comparison with other nodes in the network. The number of links ([[Degree (graph theory)|degrees]]) for a hub in a scale-free network is much higher than for the biggest node in a random network, keeping the size ''N'' of the network and average degree ''<k>'' constant. The existence of hubs is the biggest difference between random networks and scale-free networks. In random networks, the degree ''k'' is comparable for every node; it is therefore not possible for hubs to emerge. In scale-free networks, a few nodes (hubs) have a high degree ''k'' while the other nodes have a small number of links.

A hub is a component of a network with a high-degree [[Vertex (graph theory)|node]]. Hubs have a significantly larger number of links in comparison with other nodes in the network. The number of links ([[Degree (graph theory)|degrees]]) for a hub in a scale-free network is much higher than for the biggest node in a random network, keeping the size ''N'' of the network and average degree ''<k>'' constant. The existence of hubs is the biggest difference between random networks and scale-free networks. In random networks, the degree ''k'' is comparable for every node; it is therefore not possible for hubs to emerge. In scale-free networks, a few nodes (hubs) have a high degree ''k'' while the other nodes have a small number of links.