论文信息 - Using graph partitioning to calculate PageRank in a changing network

Using graph partitioning to calculate PageRank in a changing network

PageRank was first defined by S. Brin and L. Page in 1998 in order to rank home pages on the Internet by ranking pages according to the stationary distribution of a random walk on the web graph. Wh ...

Sergei Silvestrov | Christopher Engström

[1] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

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

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

[4] Fan Chung Graham,et al. Finding and Visualizing Graph Clusters Using PageRank Optimization , 2012, Internet Math..

[5] Gang Wu,et al. Lumping algorithms for computing Google’s PageRank and its derivative, with attention to unreferenced nodes , 2012, Information Retrieval.

[6] Er-Wei Bai,et al. Distributed randomized pagerank algorithms based on web aggregation over unreliable channels , 2010, 49th IEEE Conference on Decision and Control (CDC).

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

[8] Gene H. Golub,et al. A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations , 2007, Internet Math..

[9] 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.