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.

[1]  J. Hunter.  Stationary distributions of perturbed Markov chains , 1986 .

[2]  Sergei Silvestrov,et al.  The Mathematics of Internet Search Engines , 2008 .

[3]  S. Silvestrov,et al.  Calculating PageRank in a changing network with added or removed edges , 2017 .

[4]  Jasmine Novak,et al.  PageRank Computation and the Structure of the Web: Experiments and Algorithms , 2002 .

[5]  Christopher Engström,et al.  A componentwise PageRank algorithm , 2015 .

[6]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[7]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[8]  Chun Yuan Deng,et al.  A generalization of the Sherman-Morrison-Woodbury formula , 2011, Appl. Math. Lett..

[9]  David F. Gleich,et al.  An Inner-Outer Iteration for Computing PageRank , 2010, SIAM J. Sci. Comput..

[10]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[11]  Aurora E. Clark,et al.  MoleculaRnetworks: An integrated graph theoretic and data mining tool to explore solvent organization in molecular simulation , 2012, J. Comput. Chem..

[12]  Bing Zheng,et al.  On the eigenvalues of a specially rank-r updated complex matrix , 2009, Comput. Math. Appl..

[13]  G. Caldarelli,et al.  DebtRank: Too Central to Fail? Financial Networks, the FED and Systemic Risk , 2012, Scientific Reports.

[14]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[15]  Amy Nicole Langville,et al.  Google's PageRank and beyond - the science of search engine rankings , 2006 .

[16]  Desmond J. Higham,et al.  GeneRank: Using search engine technology for the analysis of microarray experiments , 2005, BMC Bioinformatics.

[17]  David F. Gleich,et al.  PageRank beyond the Web , 2014, SIAM Rev..

[18]  Er-Wei Bai,et al.  Distributed randomized PageRank computation based on web aggregation , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.