75
个编辑
更改
跳到导航
跳到搜索
第10行：
第10行： − + − +
无编辑摘要
[[File:Network representation of brain connectivity.JPG|thumb|
[[File:Network representation of brain connectivity.JPG|thumb|
图1：Network representation of brain connectivity. Hubs are highlighted|150px|right] 表示大脑连接性的网络，其中枢纽节点被突出显示]
图1：Network representation of brain connectivity. Hubs are highlighted|150px|right] 表示大脑连接性的网络，其中枢纽节点被突出显示]]
[[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|Partial map of the Internet based on the January 15, 2005. Hubs are highlighted|150px|right]
图2:2005年1月15日的因特网局部图，枢纽节点被突出显示]
图2: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.