PageRank Optimization by Edge Selection Export

@article{citeulike:6111512, 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 web-page ranking - and can be interpreted as the average portion of time spent at the node by an infinite random walk in the graph. 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 approach provides a linear programming formulation that can then be solved by standard techniques. We also show in the paper that, under the slight modification of the problem for which we are given mutually exclusive pairs of edges, the problem of PageRank optimization becomes NP-hard.}, archivePrefix = {arXiv}, author = {Cs\'{a}ji, Bal\'{a}zs C. and Jungers, Rapha\"{e}l M. and Blondel, Vincent D.}, citeulike-article-id = {6111512}, citeulike-linkout-0 = {http://arxiv.org/abs/0911.2280}, citeulike-linkout-1 = {http://arxiv.org/pdf/0911.2280}, day = {12}, eprint = {0911.2280}, keywords = {graph, pagerank}, month = {Nov}, posted-at = {2009-11-14 08:19:33}, priority = {2}, title = {PageRank Optimization by Edge Selection}, url = {http://arxiv.org/abs/0911.2280}, year = {2009} }

TY - JOUR ID - citeulike:6111512 L3 - citeulike-article-id:6111512 N2 - 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 web-page ranking - and can be interpreted as the average portion of time spent at the node by an infinite random walk in the graph. 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 approach provides a linear programming formulation that can then be solved by standard techniques. We also show in the paper that, under the slight modification of the problem for which we are given mutually exclusive pairs of edges, the problem of PageRank optimization becomes NP-hard. TI - PageRank Optimization by Edge Selection KW - graph KW - pagerank AU - Csáji, Balázs AU - Jungers, Raphaël AU - Blondel, Vincent PY - 2009/Nov/12/ UR - http://arxiv.org/abs/0911.2280 ER -