arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cond-mat/0103423cond-mat.stat-mechcond-mat.dis-nn
收藏

具有适应度的增长随机网络

Growing Random Networks with Fitness

G. Ergun, G. J. Rodgers

摘要:

利用连通度分布的速率方程,分析了具有适应度依赖增长率的三种增长随机网络模型。在第一模型(A)中,通过将进入节点连接到具有连通性$k$和随机附加适应度$η$的节点来构建网络,速率为$(k-1)+ η$。对于$η>0$,我们发现连接分布是指数为$γ=<η>+2$的幂律分布。在第二模型(B)中,通过将节点连接到具有连通性$k$、随机加性适应度$η$和具有速率$ζ(k-1)+η$的随机乘性适应度$ζ$的节点来构建网络。该模型也具有幂律连通性分布,但具有取决于每个节点处的乘法适应度的指数。在第三个模型(C)中,考虑了有向图,并通过添加节点和创建链接来构建有向图。具有适应度$(α, β)$、$i$输入链路和$j$输出链路的节点获得速率为$α(i+1)$的新输入链路和速率为$β(j+1)$的新输出链路。传入和传出链路的数量的分布都按幂律缩放,具有反对数校正。

英文摘要:

Three models of growing random networks with fitness dependent growth rates are analysed using the rate equations for the distribution of their connectivities. In the first model (A), a network is built by connecting incoming nodes to nodes of connectivity $k$ and random additive fitness $η$, with rate $(k-1)+ η$. For $η>0$ we find the connectivity distribution is power law with exponent $γ=<η>+2$. In the second model (B), the network is built by connecting nodes to nodes of connectivity $k$, random additive fitness $η$ and random multiplicative fitness $ζ$ with rate $ζ(k-1)+η$. This model also has a power law connectivity distribution, but with an exponent which depends on the multiplicative fitness at each node. In the third model (C), a directed graph is considered and is built by the addition of nodes and the creation of links. A node with fitness $(α, β)$, $i$ incoming links and $j$ outgoing links gains a new incoming link with rate $α(i+1)$, and a new outgoing link with rate $β(j+1)$. The distributions of the number of incoming and outgoing links both scale as power laws, with inverse logarithmic corrections.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑