PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
- 832 Downloads
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.
KeywordsPageRank graphs complexity Markov decision processes
Unable to display preview. Download preview PDF.
- 2.Berkhin, P.: A survey on PageRank computing. Internet Math. pp. 73–120 (2005)Google Scholar
- 4.Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proc. of the 7th Intern. Conf. on World Wide Web, pp. 107–117 (1998)Google Scholar
- 7.Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)Google Scholar
- 8.Gonzaga, C.C.: An Algorithm for Solving Linear Programming Problems in O(n 3 L) operations. In: Progress in Mathematical Programming: Interior-Point and Related Methods, pp. 1–28. Springer, Heidelberg (1988)Google Scholar
- 9.Ishii, H., Tempo, R.: Computing the PageRank variation for fragile web data. SICE J. of Control, Measurement, and System Integration 2(1), 1–9 (2009)Google Scholar
- 12.Littman, M.L., Dean, T.L., Kaelbling, L.P.: On the complexity of solving Markov decision problems. In: Proc. of the Eleventh International Conference on Uncertainty in Artificial Intelligence, pp. 394–402 (1995)Google Scholar
- 13.Lovász, L.: Random walks on graphs: A survey. In: Combinatorics: Paul Erdős is Eighty, vol. 2, pp. 348–353. Bolyai Society Mathematical Studies, Budapest (1996)Google Scholar
- 15.Sutton, R.S., Barto, A.G.: Reinforcement learning. MIT Press, Cambridge (1998)Google Scholar