PageRank optimization by edge selection
Csáji, Balázs Csanád and Jungers, R. M. and Blondel, V. D. (2014) PageRank optimization by edge selection. DISCRETE APPLIED MATHEMATICS, 169. pp. 7387. ISSN 0166218X 10.1016/j.dam.2014.01.007

Text
Csaji_73_2538164_ny.pdf Download (314kB)  Preview 

Text
Csaji_73_2538164_z.pdf Restricted to Registered users only Download (494kB) 
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 contextsincluding ranking websitesand 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. Our core solution results in a linear programming formulation, but we also provide an alternative greedy algorithm, a variant of policy iteration, which runs in polynomial time, as well. Finally, we show that, under the slight modification for which we are given mutually exclusive pairs of edges, the problem of PageRank optimization becomes NPhard. © 2014 Elsevier B.V. All rights reserved.
Item Type:  Article 

Uncontrolled Keywords:  Stochastic shortest path; PageRank; Computational complexity 
Subjects:  Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány 
Divisions:  Research Laboratory on Engineering & Management Intelligence 
SWORD Depositor:  MTMT Injector 
Depositing User:  MTMT Injector 
Date Deposited:  26 Sep 2014 19:32 
Last Modified:  26 Nov 2016 15:55 
URI:  https://eprints.sztaki.hu/id/eprint/8010 
Update Item 