Name
Abstract | ||
|---|---|---|
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%. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ASONAM.2012.89 | ASONAM |
Keywords | DocType | Volume |
scale free networks,complex networks,graph theory | Journal | abs/1111.4886 |
ISBN | Citations | PageRank |
978-1-4673-2497-7 | 0 | 0.34 |
References | Authors | |
3 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| s m vijay mahantesh | 1 | 0 | 0.34 |
| Sudarshan Iyengar | 2 | 24 | 6.03 |
| M. Vijesh | 3 | 1 | 0.70 |
| suresh nayak | 4 | 0 | 0.34 |
| narendra v shenoy | 5 | 0 | 0.34 |
| Ravi Sundaram | 6 | 762 | 72.13 |