以最优策略演化的地理网络
Geographical networks evolving with optimal policy
摘要:
在这篇文章中,我们提出了一个不断增长的网络模型的基础上,涉及拓扑和地理措施的最佳政策。在这个模型中,在每个时间步,一个新的节点,具有随机分配的坐标在一个$1 \times 1$广场,被添加和连接到一个先前存在的节点$i$,这最小化的数量$r_i^2/k_i^α$,其中$r_i$是地理距离,$k_i$的程度,和$α$的自由参数。当$α=1$时,度分布服从幂律形式,当$α=0$时,度分布服从指数形式。当$α$在区间$(0,1)$内时,网络呈现拉伸指数分布。我们证明了平均拓扑距离在网络规模的对数尺度上增加,表明小世界性质的存在。进而得到了网络的地理边长分布、所有边的总地理长度和整个网络的平均地理距离。有趣的是,我们发现当$α$超过临界值$α_c=1$时,总的边长将急剧增加,并且平均地理距离有一个与网络大小无关的上限。所有的结果都是通过一些合理的近似解析得到的,并通过仿真得到了很好的验证。
英文摘要:
In this article, we propose a growing network model based on an optimal policy involving both topological and geographical measures. In this model, at each time step, a new node, having randomly assigned coordinates in a $1 \times 1$ square, is added and connected to a previously existing node $i$, which minimizes the quantity $r_i^2/k_i^α$, where $r_i$ is the geographical distance, $k_i$ the degree, and $α$ a free parameter. The degree distribution obeys a power-law form when $α=1$, and an exponential form when $α=0$. When $α$ is in the interval $(0,1)$, the network exhibits a stretched exponential distribution. We prove that the average topological distance increases in a logarithmic scale of the network size, indicating the existence of the small-world property. Furthermore, we obtain the geographical edge-length distribution, the total geographical length of all edges, and the average geographical distance of the whole network. Interestingly, we found that the total edge-length will sharply increase when $α$ exceeds the critical value $α_c=1$, and the average geographical distance has an upper bound independent of the network size. All the results are obtained analytically with some reasonable approximations, which are well verified by simulations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。