Dynamic PageRank using evolving teleportation

16Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Rossi, R. A., & Gleich, D. F. (2012). Dynamic PageRank using evolving teleportation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7323 LNCS, pp. 126–137). https://doi.org/10.1007/978-3-642-30541-2_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free