Scale-free network growth by ranking
Scale-free network growth by ranking
复制标题
DOI：
10.1103/physrevlett.96.218701
复制
发表时间：
2006-06-02
影响因子：
8.6
通讯作者：
Menczer, Filippo
中科院分区：
文献类型：
--
作者：
Fortunato, Santo;Flammini, Alessandro;Menczer, Filippo
网络增长目前是通过依赖于节点威望度量的机制来解释的，比如程度或适应度。在许多真实的网络中，那些创建和连接节点的人并不知道现有节点的声望值，而只知道它们的声望排名。我们提出了一个网络增长的标准，该标准明确地依赖于节点根据任何威望度量的排名，无论是拓扑的还是非拓扑的。当连接目标节点的概率是其秩的任何幂律函数时，即使只有部分节点秩信息，所得到的网络也具有无标度分布。我们的标准可以解释真实网络中无标度分布的频率和鲁棒性，如Web图的特殊情况所示。
Network growth is currently explained through mechanisms that rely on node prestige measures, such as degree or fitness. In many real networks, those who create and connect nodes do not know the prestige values of existing nodes but only their ranking by prestige. We propose a criterion of network growth that explicitly relies on the ranking of the nodes according to any prestige measure, be it topological or not. The resulting network has a scale-free degree distribution when the probability to link a target node is any power-law function of its rank, even when one has only partial information of node ranks. Our criterion may explain the frequency and robustness of scale-free degree distributions in real networks, as illustrated by the special case of the Web graph.