Dynamic PageRank using evolving teleportation

From MaRDI portal
Publication:2900591

DOI10.1007/978-3-642-30541-2_10zbMATH Open1342.68040DBLPconf/waw/RossiG12arXiv1203.6098OpenAlexW1877364359WikidataQ66711226 ScholiaQ66711226MaRDI QIDQ2900591FDOQ2900591


Authors: Ryan Anthony Rossi, David F. Gleich Edit this on Wikidata


Publication date: 23 July 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1203.6098




Recommendations





Cited In (7)





This page was built for publication: Dynamic PageRank using evolving teleportation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900591)