A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
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 todoi:10.1007/978-3-642-16108-7_11 fatcat:ylugdked6fb63b2ckl3jr4q2zq