arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1111.4886cs.SIcs.NIphysics.soc-phq-bio.PE
收藏

无标度网络中节点到达的预测

Prediction Of Arrival Of Nodes In A Scale Free Network

S. M. Vijay Mahantesh, Sudarshan Iyengar, M. Vijesh, Shruthi Nayak, Nikitha Shenoy

摘要:

现实生活中观察到的大多数网络都服从幂律度分布。假设这种度分布的出现是由于节点的优先连接。Barabasi-Albert模型是一个基于度的偏好连接生成过程,可以生成幂律度分布的网络。在这个模型中,假设网络每一步增长一个节点。在这样的网络演化之后,人们不可能预测节点到达的确切顺序。在这篇文章中,我们提出了一种新的策略,部分预测节点到达这样一个进化的网络的顺序。我们表明,我们提出的方法优于其他中心性措施为基础的方法。我们对节点进行分箱,并预测分箱之间节点到达的顺序,准确率超过80%。

英文摘要:

Most of the networks observed in real life obey power-law degree distribution. It is hypothesized that the emergence of such a degree distribution is due to preferential attachment of the nodes. Barabasi-Albert model is a generative procedure that uses preferential attachment based on degree and one can use this model to generate networks with power-law degree distribution. In this model, the network is assumed to grow one node every time step. After the evolution of such a network, it is impossible for one to predict the exact order of node arrivals. We present in this article, a novel strategy to partially predict the order of node arrivals in such an evolved network. We show that our proposed method outperforms other centrality measure based approaches. We bin the nodes and predict the order of node arrivals between the bins with an accuracy of above 80%.

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

↑