Dynamic pagerank using evolving teleportation

  • Authors:
  • Ryan A. Rossi;David F. Gleich

  • Affiliations:
  • Department of Computer Science, Purdue University, West Lafayette, IN;Department of Computer Science, Purdue University, West Lafayette, IN

  • Venue:
  • WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The importance of nodes in a network constantly fluctuates based on changes in the network structure as well as changes in external interest. We propose an evolving teleportation adaptation of the PageRank method to capture how changes in external interest influence the importance of a node. This framework seamlessly generalizes PageRank because the importance of a node will converge to the PageRank values if the external influence stops changing. We demonstrate the effectiveness of the evolving teleportation on the Wikipedia graph and the Twitter social network. The external interest is given by the number of hourly visitors to each page and the number of monthly tweets for each user.