80
个编辑
更改
→Emergence 出现
Emergence of hubs can be explained by the difference between scale-free networks and random networks. Scale-free networks (Barabási–Albert model) are different from random networks (Erdős–Rényi model) in two aspects: (a) growth, (b) preferential attachment.<ref name=RMP>{{Cite journal
Emergence of hubs can be explained by the difference between scale-free networks and random networks. Scale-free networks (Barabási–Albert model) are different from random networks (Erdős–Rényi model) in two aspects: (a) growth, (b) preferential attachment.<ref name=RMP>{{Cite journal
枢纽的成因可以用无标度网络和随机网络的区别来解释。'''<font color="#ff8000">无标度网络 Scale-Free Networks</font>'''（Barabási-Albert模型）与'''<font color="#ff8000">随机网络 Random Networks</font>'''（Erdős–Rényi model）的区别主要存在于如下两个方面: （a）'''<font color="#ff8000">增长 Growth</font>'''，（b）'''<font color="#ff8000">优先链接 Preferential Attachment</font>'''。{ Cite journal
枢纽的成因可以用无标度网络和随机网络的区别来解释。'''<font color="#ff8000">无标度网络 Scale-Free Networks</font>'''（Barabási-Albert模型）与'''<font color="#ff8000">随机网络 Random Networks</font>'''（Erdős–Rényi model）的区别主要存在于如下两个方面: （a）'''<font color="#ff8000">增长 Growth</font>'''，（b）'''<font color="#ff8000">优先链接 Preferential Attachment</font>'''。
* (a) Scale-free networks assume a continuous growth of the number of nodes ''N'', compared to random networks which assume a fixed number of nodes. In scale-free networks the degree of the largest hub rises polynomially with the size of the network. Therefore, the degree of a hub can be high in a scale-free network. In random networks the degree of the largest node rises logaritmically (or slower) with N, thus the hub number will be small even in a very large network.
* (a) Scale-free networks assume a continuous growth of the number of nodes ''N'', compared to random networks which assume a fixed number of nodes. In scale-free networks the degree of the largest hub rises polynomially with the size of the network. Therefore, the degree of a hub can be high in a scale-free network. In random networks the degree of the largest node rises logaritmically (or slower) with N, thus the hub number will be small even in a very large network.