التفاصيل البيبلوغرافية
| العنوان: |
Prediction of Arrival of Nodes in a Scale Free Network. |
| المؤلفون: |
Mahantesh, S.M. Vijay, Iyengar, Sudarshan, Vijesh, M., Nayak, Shruthi R., Shenoy, Nikitha |
| المصدر: |
2012 IEEE/ACM International Conference on Advances in Social Networks Analysis & Mining; 1/ 1/2012, p517-521, 5p |
| مستخلص: |
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%. [ABSTRACT FROM PUBLISHER] |
|
Copyright of 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis & Mining is the property of IEEE and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
Full Text Finder