80
个编辑
更改
跳到导航
跳到搜索
第12行：
第12行： − 表示大脑连接性的网络，其中枢纽节点被突出显示]]+ 第18行：
第18行： − 2005年1月15日的因特网局部图，枢纽节点被突出显示]]+ 第24行：
第24行： − 一个枢纽节点是网络中具有高度值的组件。与网络中的其他节点相比，枢纽节点的链接数要大得多。无尺度网络中枢纽的链接数(度)远远高于随机网络中链接数最大的节点，在保持网络的大小''N''和平均度 ''<k>''不变的情况下。枢纽的存在是随机网络和无标度网络的最大区别。在随机网络中，每个节点的度''k''是可比的，因此不可能出现枢纽节点。在无标度网络中，少数节点(即枢纽节点)具有高度值 ''k''，而其他节点只有少量的链接。+
无编辑摘要
图1：Network representation of brain connectivity. Hubs are highlighted
图1：Network representation of brain connectivity. Hubs are highlighted
图1：大脑连接性的网络表示，其中枢纽节点被突出显示]]
图2:Partial map of the Internet based on the January 15, 2005. Hubs are highlighted
图2:Partial map of the Internet based on the January 15, 2005. Hubs are highlighted
图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.
A hub is a component of a network with a high-degree node. Hubs have a significantly larger number of links in comparison with other nodes in the network. The number of links (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 node. Hubs have a significantly larger number of links in comparison with other nodes in the network. The number of links (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.
枢纽是拥有大度节点网络的一个组成部分。与网络中的其他节点相比，枢纽的链接数要大得多。无标度网络中枢纽的链接数（度）远远高于随机网络中链接数最大的节点，在保持网络的大小''N''和平均度 ''<k>''不变的情况下。枢纽的存在是随机网络和无标度网络的最大区别。在随机网络中，每个节点的度''k''是可比的，因此不可能出现枢纽节点。在无标度网络中，少数节点(即枢纽节点)具有高度值 ''k''，而其他节点只有少量的链接。