2006
DOI: 10.1080/15326340600649052
|View full text |Cite
|
Sign up to set email alerts
|

The Effect of New Links on Google Pagerank

Abstract: PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as the frequency that a random surfer visits a Web page, and thus it reflects the popularity of a Web page. We study the effect of newly created links on Google PageRank. We discuss to what extent a page can control its PageRank. Using asymptotic analysis we provide simple conditions that show whether or not new links result in increased PageRank for a Web page and its neighbors. Furthermore, we sho… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
88
0
3

Year Published

2008
2008
2023
2023

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 96 publications
(91 citation statements)
references
References 13 publications
0
88
0
3
Order By: Relevance
“…Not only the power iteration method becomes very slowly convergent but also the ranking of the important pages becomes distorted. Independently of [7], this phenomenon was also mentioned in [2]. We also remark that another incentive to reduce c is that it will increase the robustness of the PageRank towards small changes in the link structure.…”
Section: Introductionmentioning
confidence: 88%
See 3 more Smart Citations
“…Not only the power iteration method becomes very slowly convergent but also the ranking of the important pages becomes distorted. Independently of [7], this phenomenon was also mentioned in [2]. We also remark that another incentive to reduce c is that it will increase the robustness of the PageRank towards small changes in the link structure.…”
Section: Introductionmentioning
confidence: 88%
“…In the present work, we go further than [7,2] and suggest that even the value c = 0.85 is by far too large. Our argument is that one has to make a choice of c to reflect the natural intensity of the probability flow in the absorbing Markov chain associated with the Web Graph.…”
Section: Introductionmentioning
confidence: 89%
See 2 more Smart Citations
“…Although it focuses less on game theoretic aspects, there is a large literature on optimal linking strategies to maximize the PageRank of given nodes for directed graphs. On the positive side, Avrachenkov and Litvak [5] give a polynomial-time algorithm for maximizing the PageRank of a single node by selecting its outlinks. Kerchove et.…”
Section: Introductionmentioning
confidence: 99%