PageRank in Evolving Tree Graphs
In this article, we study how PageRank can be updated in an evolving tree graph. We are interested in finding how ranks of the graph can be updated simultaneously and effectively using previous ranks without resorting to iterative methods such as the Jacobi or Power method. We demonstrate and discuss how PageRank can be updated when a leaf is added to a tree, at least one leaf is added to a vertex with at least one outgoing edge, an edge added to vertices at the same level and forward edge is added in a tree graph. The results of this paper provide new insights and applications of standard partitioning of vertices of the graph into levels using breadth-first search algorithm. Then, one determines PageRanks as the expected numbers of random walk starting from any vertex in the graph. We noted that time complexity of the proposed method is linear, which is quite good. Also, it is important to point out that the types of vertex play essential role in updating of PageRank.
KeywordsBreadth-first search Forward edge PageRank Random walk Tree
This research was supported by the Swedish International Development Cooperation Agency (Sida), International Science Programme (ISP) in Mathematical Sciences (IPMS), Sida Bilateral Research Program (Makerere University and University of Dar-es-Salaam). We are also grateful to the research environment Mathematics and Applied Mathematics (MAM), Division of Applied Mathematics, Mälardålen University for providing an excellent and inspiring environment for research education and research. The authors are grateful to Dmitrii Silvestrov for useful comments and discussions.
- 2.Arasu, A., Novak, J., Tomkins, A., Tomlin, J.: PageRank computation and the structure of the web: experiments and algorithms. In: Proceedings of the Eleventh International World Wide Web Conference, Poster Track, pp. 107–117 (2002)Google Scholar
- 3.Battiston, S., Puliga, M., Kaushik, R., Tasca, P., Calderelli, G.: DeptRank: too central to fail? Financial networks, the fed and systemic risk. Technical report (2012)Google Scholar
- 6.Engström, C., Silvestrov, S.: A componentwise PageRank algorithm. In: Bozeman, J.R., Oliveira, T., Skiadas, C.H. (eds.) Stochastic and Data Analysis Methods and Applications in Statistics and Demography, ASMDA 2015 Proceedings: 16th Applied Stochastic Models and Data Analysis International Conference with 4th Demographics 2015 Workshop, ISAST: International Society for the Advancement of Science and Technology, pp. 375–388 (2016)Google Scholar
- 7.Engström, C., Silvestrov, S.: Calculating Pagerank in a changing network with added or removed edges. In: Proceedings of ICNPAA 2016 World Congress, AIP Conference Proceedings 1798, 020052-1-020052-8 (2017). https://doi.org/10.1063/1.4972644
- 12.Ishii, H., Tempo, R., Bai, E., Dabbene, F.: Distributed randomized PageRank computation based on web aggregation. In: Proceedings of the 48h IEEE Conference on Decision and Control (CDC) Held Jointly with 2009 28th Chinese Control Conference, pp. 3026–3031 (2009)Google Scholar
- 13.Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in P2P networks. In: Proceedings of the 12th International Conference on World Wide Web, WWW’03, pp. 640–651 (2003)Google Scholar
- 14.Langville, A.N., Mayer, C.D.: Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)Google Scholar
- 15.Lee, C.P.C., Golub, G.H., Zenios, S.A.: A fast two-stage algorithm for computing PageRank and its extensions. Sci. Comput. Comput. Math. 1(1), 1–9 (2003)Google Scholar
- 18.Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Stanford InfoLab (1999)Google Scholar
- 20.Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference, pp. 721–724 (2002)Google Scholar