PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation

Csáji, Balázs Csanád;Jungers, Raphaël;Blondel, Vincent
(2010) Algorithmic Learning Theory. 21st International Conference, ALT 2010. — Location: Canberra, ACT, Australia (6.October.2010)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 261.75 KB
Request a copy

Details

Authors
Abstract
The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts including ranking websites and can be interpreted as the average portion of time spent at the node by an infinite random walk. We consider the problem of maximizing the PageRank of a node by selecting some of the edges from a set of edges that are under our control. By applying results from Markov decision theory, we show that an optimal solution to this problem can be found in polynomial time. It also indicates that the provided reformulation is well-suited for reinforcement learning algorithms. Finally, we show that, under the slight modification for which we are given mutually exclusive pairs of edges, the problem of PageRank optimization becomes NP-hard.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Csáji, B. C., Jungers, R., & Blondel, V. (2010). PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation. In Hutter, M.; Stephan, F.; Vovk, V.; Zeugmann, T. (ed.), Proceedings of the 21st International Conference on Algorithmic Learning Theory (pp. 89-103). Springer. https://doi.org/10.1007/978-3-642-16108-7_11