PageRank Optimization by Edge Selection

Details PageRank Optimization by Edge Selection PageRank Optimization by Edge Selection

2009-11-12

arxiv.org/abs/0911.2280v2

Computer Science

Data Structures and Algorithms

30 pages, 3 figures

Scientific paper

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. 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 NP-hard.

Affiliated with

Also associated with

No associations

Rating

PageRank Optimization by Edge Selection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with PageRank Optimization by Edge Selection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PageRank Optimization by Edge Selection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149977