复杂网络中的平均路径长度:模式与预测
Average Path Length in Complex Networks: Patterns and Predictions
摘要:
一个简单而准确的关系表明,在一个复杂的网络连接的平均最短路径,节点和边缘。这种关系利用了链接密度的概念,并在所有尺度的拟合网络中显示出比典型的随机图模型有很大的改进。这里的关系可以让研究人员更好地预测几乎任何规模的网络的最短路径。
英文摘要:
A simple and accurate relationship is demonstrated that links the average shortest path, nodes, and edges in a complex network. This relationship takes advantage of the concept of link density and shows a large improvement in fitting networks of all scales over the typical random graph model. The relationships herein can allow researchers to better predict the shortest path of networks of almost any size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。