### Page Rank

**PageRank**is an Facts about Google and Competition

^{[2]}

^{[3]}Google uses an automated web spider called Googlebot to actually count links and gather other information on web pages.

## Contents

## Description

PageRank is a link analysis algorithm and it assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of "measuring" its relative importance within the set. The algorithm may be applied to any collection of entities with reciprocal quotations and references. The numerical weight that it assigns to any given element *E* is referred to as the *PageRank of E* and denoted by $PR(E).$

A PageRank results from a mathematical algorithm based on the webgraph, created by all World Wide Web pages as nodes and hyperlinks as edges, taking into consideration authority hubs such as cnn.com or usa.gov. The rank value indicates an importance of a particular page. A hyperlink to a page counts as a vote of support. The PageRank of a page is defined recursively and depends on the number and PageRank metric of all pages that link to it ("incoming links"). A page that is linked to by many pages with high PageRank receives a high rank itself. If there are no links to a web page, then there is no support for that page. The value of incoming links is known as "Google juice", "link juice" or "Pagerank juice".**
**

Numerous academic papers concerning PageRank have been published since Page and Brin's original paper.^{[4]} In practice, the PageRank concept may be vulnerable to manipulation. Research has been conducted into identifying falsely influenced PageRank rankings. The goal is to find an effective means of ignoring links from documents with falsely influenced PageRank.

Other link-based ranking algorithms for Web pages include the HITS algorithm invented by Jon Kleinberg (used by Teoma and now Ask.com)**, the IBM CLEVER project, the TrustRank algorithm and the hummingbird algorithm.
**

## History

The idea of formulating a link analysis problem as a eigenvalue problem was probably first suggested in 1976 by Gabriel Pinski and Francis Narin, who worked on scientometrics ranking scientific journals.^{[5]}
PageRank was developed at Stanford University by Larry Page and Sergey Brin in 1996^{[6]} as part of a research project about a new kind of search engine.^{[7]} Sergey Brin had the idea that information on the web could be ordered in a hierarchy by "link popularity": a page is ranked higher as there are more links to it.^{[8]} It was co-authored by Rajeev Motwani and Terry Winograd. The first paper about the project, describing PageRank and the initial prototype of the Google search engine, was published in 1998:^{[4]} shortly after, Page and Brin founded Google Inc., the company behind the Google search engine. While just one of many factors that determine the ranking of Google search results, PageRank continues to provide the basis for all of Google's web search tools.^{[9]}

The name "PageRank" plays off of the name of developer Larry Page, as well as the concept of a

PageRank has been influenced by citation analysis, early developed by Eugene Garfield in the 1950s at the University of Pennsylvania, and by Hyper Search, developed by Massimo Marchiori at the University of Padua. In the same year PageRank was introduced (1998), Jon Kleinberg published his important work on HITS. Google's founders cite Garfield, Marchiori, and Kleinberg in their original paper.^{[4]}

A small search engine called "RankDex" from IDD Information Services designed by Robin Li was, since 1996, already exploring a similar strategy for site-scoring and page ranking.^{[13]} The technology in RankDex would be patented by 1999^{[14]} and used later when Li founded Baidu in China.^{[15]}^{[16]} Li's work would be referenced by some of Larry Page's U.S. patents for his Google search methods.^{[17]}

## Algorithm

PageRank is a probability distribution used to represent the likelihood that a person randomly clicking on links will arrive at any particular page. PageRank can be calculated for collections of documents of any size. It is assumed in several research papers that the distribution is evenly divided among all documents in the collection at the beginning of the computational process. The PageRank computations require several passes, called "iterations", through the collection to adjust approximate PageRank values to more closely reflect the theoretical true value.

A probability is expressed as a numeric value between 0 and 1. A 0.5 probability is commonly expressed as a "50% chance" of something happening. Hence, a PageRank of 0.5 means there is a 50% chance that a person clicking on a random link will be directed to the document with the 0.5 PageRank.

### Simplified algorithm

Assume a small universe of four web pages: **A**, **B**, **C** and **D**. Links from a page to itself, or multiple outbound links from one single page to another single page, are ignored. PageRank is initialized to the same value for all pages. In the original form of PageRank, the sum of PageRank over all pages was the total number of pages on the web at that time, so each page in this example would have an initial PageRank of 1. However, later versions of PageRank, and the remainder of this section, assume a probability distribution between 0 and 1. Hence the initial value for each page is 0.25.

The PageRank transferred from a given page to the targets of its outbound links upon the next iteration is divided equally among all outbound links.

If the only links in the system were from pages **B**, **C**, and **D** to **A**, each link would transfer 0.25 PageRank to **A** upon the next iteration, for a total of 0.75.

- $PR(A)=\; PR(B)\; +\; PR(C)\; +\; PR(D).\backslash ,$

Suppose instead that page **B** had a link to pages **C** and **A**, page **C** had a link to page **A**, and page **D** had links to all three pages. Thus, upon the next iteration, page **B** would transfer half of its existing value, or 0.125, to page **A** and the other half, or 0.125, to page **C**. Page **C** would transfer all of its existing value, 0.25, to the only page it links to, **A**. Since **D** had three outbound links, it would transfer one third of its existing value, or approximately 0.083, to **A**. At the completion of this iteration, page **A** will have a PageRank of 0.458.

- $PR(A)=\; \backslash frac\{PR(B)\}\{2\}+\; \backslash frac\{PR(C)\}\{1\}+\; \backslash frac\{PR(D)\}\{3\}.\backslash ,$

In other words, the PageRank conferred by an outbound link is equal to the document's own PageRank score divided by the number of outbound links **L( )**.

- $PR(A)=\; \backslash frac\{PR(B)\}\{L(B)\}+\; \backslash frac\{PR(C)\}\{L(C)\}+\; \backslash frac\{PR(D)\}\{L(D)\}.\; \backslash ,$

In the general case, the PageRank value for any page **u** can be expressed as:

- $PR(u)\; =\; \backslash sum\_\{v\; \backslash in\; B\_u\}\; \backslash frac\{PR(v)\}\{L(v)\}$,

i.e. the PageRank value for a page **u** is dependent on the PageRank values for each page **v** contained in the set **B _{u}** (the set containing all pages linking to page

**u**), divided by the number

*L*(

*v*) of links from page

**v**.

### Damping factor

The PageRank theory holds that an imaginary surfer who is randomly clicking on links will eventually stop clicking. The probability, at any step, that the person will continue is a damping factor *d*. Various studies have tested different damping factors, but it is generally assumed that the damping factor will be set around 0.85.^{[4]}

The damping factor is subtracted from 1 (and in some variations of the algorithm, the result is divided by the number of documents (*N*) in the collection) and this term is then added to the product of the damping factor and the sum of the incoming PageRank scores. That is,

- $PR(A)\; =\; \{1\; -\; d\; \backslash over\; N\}\; +\; d\; \backslash left(\; \backslash frac\{PR(B)\}\{L(B)\}+\; \backslash frac\{PR(C)\}\{L(C)\}+\; \backslash frac\{PR(D)\}\{L(D)\}+\backslash ,\backslash cdots\; \backslash right).$

So any page's PageRank is derived in large part from the PageRanks of other pages. The damping factor adjusts the derived value downward. The original paper, however, gave the following formula, which has led to some confusion:

- $PR(A)=\; 1\; -\; d\; +\; d\; \backslash left(\; \backslash frac\{PR(B)\}\{L(B)\}+\; \backslash frac\{PR(C)\}\{L(C)\}+\; \backslash frac\{PR(D)\}\{L(D)\}+\backslash ,\backslash cdots\; \backslash right).$

The difference between them is that the PageRank values in the first formula sum to one, while in the second formula each PageRank is multiplied by *N* and the sum becomes *N*. A statement in Page and Brin's paper that "the sum of all PageRanks is one"^{[4]} and claims by other Google employees^{[18]} support the first variant of the formula above.

Page and Brin confused the two formulas in their most popular paper "The Anatomy of a Large-Scale Hypertextual Web Search Engine", where they mistakenly claimed that the latter formula formed a probability distribution over web pages.^{[4]}

Google recalculates PageRank scores each time it crawls the Web and rebuilds its index. As Google increases the number of documents in its collection, the initial approximation of PageRank decreases for all documents.

The formula uses a model of a *random surfer* who gets bored after several clicks and switches to a random page. The PageRank value of a page reflects the chance that the random surfer will land on that page by clicking on a link. It can be understood as a Markov chain in which the states are pages, and the transitions, which are all equally probable, are the links between pages.

If a page has no links to other pages, it becomes a sink and therefore terminates the random surfing process. If the random surfer arrives at a sink page, it picks another URL at random and continues surfing again.

When calculating PageRank, pages with no outbound links are assumed to link out to all other pages in the collection. Their PageRank scores are therefore divided evenly among all other pages. In other words, to be fair with pages that are not sinks, these random transitions are added to all nodes in the Web, with a residual probability usually set to *d *= 0.85, estimated from the frequency that an average surfer uses his or her browser's bookmark feature.

So, the equation is as follows:

- $PR(p\_i)\; =\; \backslash frac\{1-d\}\{N\}\; +\; d\; \backslash sum\_\{p\_j\; \backslash in\; M(p\_i)\}\; \backslash frac\{PR\; (p\_j)\}\{L(p\_j)\}$

where $p\_1,\; p\_2,\; ...,\; p\_N$ are the pages under consideration, $M(p\_i)$ is the set of pages that link to $p\_i$, $L(p\_j)$ is the number of outbound links on page $p\_j$, and *N* is the total number of pages.

The PageRank values are the entries of the dominant eigenvector of the modified adjacency matrix. This makes PageRank a particularly elegant metric: the eigenvector is

- $$

\mathbf{R} =
\begin{bmatrix}
PR(p_1) \\
PR(p_2) \\
\vdots \\
PR(p_N)
\end{bmatrix}
where **R** is the solution of the equation

- $$

\mathbf{R} =

\begin{bmatrix} {(1-d)/ N} \\ {(1-d) / N} \\ \vdots \\ {(1-d) / N} \end{bmatrix}

+ d

\begin{bmatrix} \ell(p_1,p_1) & \ell(p_1,p_2) & \cdots & \ell(p_1,p_N) \\ \ell(p_2,p_1) & \ddots & & \vdots \\ \vdots & & \ell(p_i,p_j) & \\ \ell(p_N,p_1) & \cdots & & \ell(p_N,p_N) \end{bmatrix}

\mathbf{R}

where the adjacency function $\backslash ell(p\_i,p\_j)$ is 0 if page $p\_j$ does not link to $p\_i$, and normalized such that, for each *j*

- $\backslash sum\_\{i\; =\; 1\}^N\; \backslash ell(p\_i,p\_j)\; =\; 1$,

i.e. the elements of each column sum up to 1, so the matrix is a stochastic matrix (for more details see the computation section below). Thus this is a variant of the eigenvector centrality measure used commonly in network analysis.

Because of the large eigengap of the modified adjacency matrix above,^{[19]} the values of the PageRank eigenvector can be approximated to within a high degree of accuracy within only a few iterations.

As a result of Markov theory, it can be shown that the PageRank of a page is the probability of arriving at that page after a large number of clicks. This happens to equal $t^\{-1\}$ where $t$ is the expectation of the number of clicks (or random jumps) required to get from the page back to itself.

One main disadvantage of PageRank is that it favors older pages. A new page, even a very good one, will not have many links unless it is part of an existing site (a site being a densely connected set of pages, such as World Heritage Encyclopedia).

Several strategies have been proposed to accelerate the computation of PageRank.^{[20]}

Various strategies to manipulate PageRank have been employed in concerted efforts to improve search results rankings and monetize advertising links. These strategies have severely impacted the reliability of the PageRank concept**, which purports to determine which documents are actually highly valued by the Web community.
**

Since December 2007, when it started *actively* penalizing sites selling paid text links, Google has combatted link farms and other schemes designed to artificially inflate PageRank. How Google identifies link farms and other PageRank manipulation tools is among Google's trade secrets.

### Computation

PageRank can be computed either iteratively or algebraically. The iterative method can be viewed as the
power iteration method^{[21]}^{[22]} or the power method. The basic mathematical operations performed are identical.

#### Iterative

At $t=0$, an initial probability distribution is assumed, usually

- $PR(p\_i;\; 0)\; =\; \backslash frac\{1\}\{N\}$.

At each time step, the computation, as detailed above, yields

- $PR(p\_i;t+1)\; =\; \backslash frac\{1-d\}\{N\}\; +\; d\; \backslash sum\_\{p\_j\; \backslash in\; M(p\_i)\}\; \backslash frac\{PR\; (p\_j;\; t)\}\{L(p\_j)\}$,

or in matrix notation

- $\backslash mathbf\{R\}(t+1)\; =\; d\; \backslash mathcal\{M\}\backslash mathbf\{R\}(t)\; +\; \backslash frac\{1-d\}\{N\}\; \backslash mathbf\{1\}$, (*)

where $\backslash mathbf\{R\}\_i(t)=PR(p\_i;\; t)$ and $\backslash mathbf\{1\}$ is the column vector of length $N$ containing only ones.

The matrix $\backslash mathcal\{M\}$ is defined as

- $\backslash mathcal\{M\}\_\{ij\}\; =\; \backslash begin\{cases\}\; 1\; /L(p\_j)\; ,\; \&\; \backslash mbox\{if\; \}j\backslash mbox\{\; links\; to\; \}i\backslash \; \backslash \backslash \; 0,\; \&\; \backslash mbox\{otherwise\}\; \backslash end\{cases\}$

i.e.,

- $\backslash mathcal\{M\}:=\; (K^\{-1\}\; A)^T$,

where $A$ denotes the adjacency matrix of the graph and $K$ is the diagonal matrix with the outdegrees in the diagonal.

The computation ends when for some small $\backslash epsilon$

- $|\backslash mathbf\{R\}(t+1)\; -\; \backslash mathbf\{R\}(t)|\; <\; \backslash epsilon$,

i.e., when convergence is assumed.

#### Algebraic

For $t\; \backslash to\; \backslash infty$ (i.e., in the steady state), the above equation (*) reads

- $\backslash mathbf\{R\}\; =\; d\; \backslash mathcal\{M\}\backslash mathbf\{R\}\; +\; \backslash frac\{1-d\}\{N\}\; \backslash mathbf\{1\}$. (**)

The solution is given by

- $\backslash mathbf\{R\}\; =\; (\backslash mathbf\{I\}-d\; \backslash mathcal\{M\})^\{-1\}\; \backslash frac\{1-d\}\{N\}\; \backslash mathbf\{1\}$,

with the identity matrix $\backslash mathbf\{I\}$.

The solution exists and is unique for $0\; <\; d\; <\; 1$. This can be seen by noting that $\backslash mathcal\{M\}$ is by construction a stochastic matrix and hence has an eigenvalue equal to one as a consequence of the Perron–Frobenius theorem.

#### Power Method

If the matrix $\backslash mathcal\{M\}$ is a transition probability, i.e., column-stochastic with no columns consisting of just zeros and $\backslash mathbf\{R\}$ is a probability distribution (i.e., $|\backslash mathbf\{R\}|=1$, $\backslash mathbf\{E\}\backslash mathbf\{R\}=1$ where $\backslash mathbf\{E\}$ is matrix of all ones), Eq. (**) is equivalent to

- $\backslash mathbf\{R\}\; =\; \backslash left(\; d\; \backslash mathcal\{M\}\; +\; \backslash frac\{1-d\}\{N\}\; \backslash mathbf\{E\}\; \backslash right)\backslash mathbf\{R\}\; =:\; \backslash widehat\{\; \backslash mathcal\{M\}\}\; \backslash mathbf\{R\}$. (***)

Hence PageRank $\backslash mathbf\{R\}$ is the principal eigenvector of $\backslash widehat\{\backslash mathcal\{M\}\}$. A fast and easy way to compute this is using the power method: starting with an arbitrary vector $x(0)$, the operator $\backslash widehat\{\backslash mathcal\{M\}\}$ is applied in succession, i.e.,

- $x(t+1)\; =\; \backslash widehat\{\backslash mathcal\{M\}\}\; x(t)$,

until

- $|x(t+1)\; -\; x(t)|\; <\; \backslash epsilon$.

Note that in Eq. (***) the matrix on the right-hand side in the parenthesis can be interpreted as

- $\backslash frac\{1-d\}\{N\}\; \backslash mathbf\{I\}\; =\; (1-d)\backslash mathbf\{P\}\; \backslash mathbf\{1\}^t$,

where $\backslash mathbf\{P\}$ is an initial probability distribution. In the current case

- $\backslash mathbf\{P\}:=\; \backslash frac\{1\}\{N\}\; \backslash mathbf\{1\}$.

Finally, if $\backslash mathcal\{M\}$ has columns with only zero values, they should be replaced with the initial probability vector $\backslash mathbf\{P\}$. In other words

- $\backslash mathcal\{M\}^\backslash prime:=\; \backslash mathcal\{M\}\; +\; \backslash mathcal\{D\}$,

where the matrix $\backslash mathcal\{D\}$ is defined as

- $\backslash mathcal\{D\}:=\; \backslash mathbf\{P\}\; \backslash mathbf\{D\}^t$,

with

- $\backslash mathbf\{D\}\_i\; =\; \backslash begin\{cases\}\; 1,\; \&\; \backslash mbox\{if\; \}L(p\_i)=0\backslash \; \backslash \backslash \; 0,\; \&\; \backslash mbox\{otherwise\}\; \backslash end\{cases\}$

In this case, the above two computations using $\backslash mathcal\{M\}$ only give the same PageRank if their results are normalized:

- $\backslash mathbf\{R\}\_\{\backslash textrm\{power\}\}\; =\; \backslash frac\{\backslash mathbf\{R\}\_\{\backslash textrm\{iterative\}\}\}\{|\backslash mathbf\{R\}\_\{\backslash textrm\{iterative\}\}|\}\; =$

\frac{\mathbf{R}_{\textrm{algebraic}}}{|\mathbf{R}_{\textrm{algebraic}}|}.

PageRank MATLAB/Octave implementation

% Parameter M adjacency matrix where M_i,j represents the link from 'j' to 'i', such that for all 'j' sum(i, M_i,j) = 1 % Parameter d damping factor % Parameter v_quadratic_error quadratic error for v % Return v, a vector of ranks such that v_i is the i-th rank from [0, 1] function [v] = rank(M, d, v_quadratic_error) N = size(M, 2); % N is equal to half the size of M v = rand(N, 1); v = v ./ norm(v, 2); last_v = ones(N, 1) * inf; M_hat = (d .* M) + (((1 - d) / N) .* ones(N, N)); while(norm(v - last_v, 2) > v_quadratic_error) last_v = v; v = M_hat * v; v = v ./ norm(v, 2); end endfunction function [v] = rank2(M, d, v_quadratic_error) N = size(M, 2); % N is equal to half the size of M v = rand(N, 1); v = v ./ norm(v, 1); % This is now L1, not L2 last_v = ones(N, 1) * inf; M_hat = (d .* M) + (((1 - d) / N) .* ones(N, N)); while(norm(v - last_v, 2) > v_quadratic_error) last_v = v; v = M_hat * v; % removed the L2 norm of the iterated PR end endfunction

Example of code calling the rank function defined above:

M = [0 0 0 0 1 ; 0.5 0 0 0 0 ; 0.5 0 0 0 0 ; 0 1 0.5 0 0 ; 0 0 0.5 1 0]; rank(M, 0.80, 0.001)

This example takes 13 iterations to converge.

The following is a proof that rank.m is incorrect. It's based on the first graphic example. My understanding is that rank.m uses the wrong norm on the input, then continues to renormalize L2, which is unnecessary.

% This represents the example graph, correctly normalized and accounting for sinks (Node A) % by allowing it to effectively random transition 100% of time, including to itself. % While RANK.m doesn't actually handle this incorrectly, it does not show exactly how one should % handle sink nodes (one possible solution would be a SELF-TRANSITION of 1.0), which does not % give the correct result. test_graph = ... [ 0.09091 0.00000 0.00000 0.50000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000; 0.09091 0.00000 1.00000 0.50000 0.33333 0.50000 0.50000 0.50000 0.50000 0.00000 0.00000; 0.09091 1.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000; 0.09091 0.00000 0.00000 0.00000 0.33333 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000; 0.09091 0.00000 0.00000 0.00000 0.00000 0.50000 0.50000 0.50000 0.50000 1.00000 1.00000; 0.09091 0.00000 0.00000 0.00000 0.33333 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000; 0.09091 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000; 0.09091 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000; 0.09091 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000; 0.09091 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000; 0.09091 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0.00000 ] pr = rank(test_graph, 0.85, 0.001) % INCORRECT is not normalized. % 0.062247 % 0.730223 % 0.650829 % 0.074220 % 0.153590 % 0.074220 % 0.030703 % 0.030703 % 0.030703 % 0.030703 % 0.030703 pr / norm(pr,1) % CORRECT once normalized. I still don't know why the L2 normalization happens ( v = v/norm(v, 2)) % 0.032781 % 0.384561 % 0.342750 % 0.039087 % 0.080886 % 0.039087 % 0.016170 % 0.016170 % 0.016170 % 0.016170 % 0.016170 pr = rank2(test_graph, 0.85, 0.001) % CORRECT, only requires input PR normalization (make sure it sums to 1.0) % 0.032781 % 0.384561 % 0.342750 % 0.039087 % 0.080886 % 0.039087 % 0.016170 % 0.016170 % 0.016170 % 0.016170 % 0.016170

#### Efficiency

Depending on the framework used to perform the computation, the exact implementation of the methods, and the required accuracy of the result, the computation time of the these methods can vary greatly.

## Variations

### PageRank of an undirected graph

The PageRank of an undirected graph G is statistically close to the degree distribution of the graph G,^{[23]} but they are generally not identical: If R is the PageRank vector defined above, and D is the degree distribution vector

- $$

D = {1\over 2|E|}
\begin{bmatrix}
deg(p_1) \\
deg(p_2) \\
\vdots \\
deg(p_N)
\end{bmatrix}
where $deg(p\_i)$ denotes the degree of vertex $p\_i$, and E is the edge-set of the graph, then, with $Y=\{1\backslash over\; N\}\backslash mathbf\{1\}$, by:^{[24]}

$\{1-d\backslash over1+d\}\backslash |Y-D\backslash |\_1\backslash leq\; \backslash |R-D\backslash |\_1\backslash leq\; \backslash |Y-D\backslash |\_1,$

that is, the PageRank of an undirected graph equals to the degree distribution vector if and only if the graph is regular, i.e., every vertex has the same degree.

### Distributed Algorithm for PageRank Computation

There are simple and fast random walk-based distributed algorithms for computing PageRank of nodes in a network.^{[25]} They present a simple algorithm that takes $O(\backslash log\; n/\backslash epsilon)$ rounds with high probability on any graph (directed or undirected),
where n is the network size and $\backslash epsilon$ is the reset probability ($1-\backslash epsilon$ is also called as damping factor) used in the
PageRank computation. They also present a faster algorithm that takes $O(\backslash sqrt\{\backslash log\; n\}/\backslash epsilon)$ rounds in undirected graphs.
Both of the above algorithms are scalable, as each node processes and sends only small (polylogarithmic in n, the network size) number of bits per round.
For directed graphs, they present an algorithm that has a running time of $O(\backslash sqrt\{\backslash log\; n/\backslash epsilon\})$, but it requires
a polynomial number of bits to processed and sent per node in a round.

### Google Toolbar

The Google Toolbar's PageRank feature displays a visited page's PageRank as a whole number between 0 and 10. The most popular websites have a PageRank of 10. The least have a PageRank of 0. Google has not disclosed the specific method for determining a Toolbar PageRank value, which is to be considered only a rough indication of the value of a website.

PageRank measures the number of sites that link to a particular page.^{[26]} The PageRank of a particular page is roughly based upon the quantity of inbound links as well as the PageRank of the pages providing the links. The algorithm also includes other factors, such as the size of a page, the number of changes, the time since the page was updated, the text in headlines and the text in hyperlinked anchor texts.^{[8]}

The Google Toolbar's PageRank is updated infrequently, so the values it shows are often out of date.

### SERP Rank

The search engine results page (SERP) is the actual result returned by a search engine in response to a keyword query. The SERP consists of a list of links to web pages with associated text snippets. The SERP rank of a web page refers to the placement of the corresponding link on the SERP, where higher placement means higher SERP rank. The SERP rank of a web page is a function not only of its PageRank, but of a relatively large and continuously adjusted set of factors (over 200),.^{[27]} Search engine optimization (SEO) is aimed at influencing the SERP rank for a website or a set of web pages.

Positioning of a webpage on Google SERPs for a keyword depends on relevance and reputation, also known as authority and popularity. PageRank is Google’s indication of its assessment of the reputation of a webpage: It is non-keyword specific. Google uses a combination of webpage and website authority to determine the overall authority of a webpage competing for a keyword.^{[28]} The PageRank of the HomePage of a website is the best indication Google offers for website authority.^{[29]}

After the introduction of Google Places into the mainstream organic SERP, numerous other factors in addition to PageRank affect ranking a business in Local Business Results.^{[30]}

### Google directory PageRank

The Google Directory PageRank was an 8-unit measurement. Unlike the Google Toolbar, which shows a numeric PageRank value upon mouseover of the green bar, the Google Directory only displayed the bar, never the numeric values. Google Directory was closed on July 20th, 2011.^{[31]}

### False or spoofed PageRank

In the past, the PageRank shown in the Toolbar was easily manipulated. Redirection from one page to another, either via a HTTP 302 response or a "Refresh" meta tag, caused the source page to acquire the PageRank of the destination page. Hence, a new page with PR 0 and no incoming links could have acquired PR 10 by redirecting to the Google home page. This spoofing technique, also known as 302 Google Jacking, was a known vulnerability. Spoofing can generally be detected by performing a Google search for a source URL; if the URL of an entirely different site is displayed in the results, the latter URL may represent the destination of a redirection.

### Manipulating PageRank

For search engine optimization purposes, some companies offer to sell high PageRank links to webmasters.^{[32]} As links from higher-PR pages are believed to be more valuable, they tend to be more expensive. It can be an effective and viable marketing strategy to buy link advertisements on content pages of quality and relevant sites to drive traffic and increase a webmaster's link popularity. However, Google has publicly warned webmasters that if they are or were discovered to be selling links for the purpose of conferring PageRank and reputation, their links will be devalued (ignored in the calculation of other pages' PageRanks). The practice of buying and selling links is intensely debated across the Webmaster community. Google advises webmasters to use the nofollow HTML attribute value on sponsored links. According to Matt Cutts, Google is concerned about webmasters who try to game the system, and thereby reduce the quality and relevance of Google search results.^{[32]}

### The intentional surfer model

The original PageRank algorithm reflects the so-called random surfer model, meaning that the PageRank of a particular page is derived from the theoretical probability of visiting that page when clicking on links at random. A page ranking model that reflects the importance of a particular page as a function of how many actual visits it receives by real users is called the *intentional surfer model*.^{[33]} The Google toolbar sends information to Google for every page visited, and thereby provides a basis for computing PageRank based on the intentional surfer model. The introduction of the nofollow attribute by Google to combat Spamdexing has the side effect that webmasters commonly use it on outgoing links to increase their own PageRank. This causes a loss of actual links for the Web crawlers to follow, thereby making the original PageRank algorithm based on the random surfer model potentially unreliable. Using information about users' browsing habits provided by the Google toolbar partly compensates for the loss of information caused by the nofollow attribute. The SERP rank of a page, which determines a page's actual placement in the search results, is based on a combination of the random surfer model (PageRank) and the intentional surfer model (browsing habits) in addition to other factors.^{[34]}

### Other uses

A version of PageRank has recently been proposed as a replacement for the traditional eigenfactor.org. Instead of merely counting total citation to a journal, the "importance" of each citation is determined in a PageRank fashion.

A similar new use of PageRank is to rank academic doctoral programs based on their records of placing their graduates in faculty positions. In PageRank terms, academic departments link to each other by hiring their faculty from each other (and from themselves).^{[36]}

PageRank has been used to rank spaces or streets to predict how many people (pedestrians or vehicles) come to the individual spaces or streets.^{[37]}^{[38]} In lexical semantics it has been used to perform Word Sense Disambiguation^{[39]} and to automatically rank WordNet synsets according to how strongly they possess a given semantic property, such as positivity or negativity.^{[40]}

A dynamic weighting method similar to PageRank has been used to generate customized reading lists based on the link structure of World Heritage Encyclopedia.^{[41]}

A Web crawler may use PageRank as one of a number of importance metrics it uses to determine which URL to visit during a crawl of the web. One of the early working papers
^{[42]} that were used in the creation of Google is *Efficient crawling through URL ordering*,^{[43]}
which discusses the use of a number of different importance metrics to determine how deeply, and how much of a site Google will crawl. PageRank is presented as one of a number of these importance metrics, though there are others listed such as the number of inbound and outbound links for a URL, and the distance from the root directory on a site to the URL.

The PageRank may also be used as a Scale-free network paradigm.

In any ecosystem, a modified version of PageRank may be used to determine species that are essential to the continuing health of the environment.^{[44]}

For the analysis of protein networks in biology PageRank is also a useful tool.^{[45]}
^{[46]}

## nofollow

In early 2005, Google implemented a new value, "nofollow",^{[47]} for the rel attribute of HTML link and anchor elements, so that website developers and bloggers can make links that Google will not consider for the purposes of PageRank—they are links that no longer constitute a "vote" in the PageRank system. The nofollow relationship was added in an attempt to help combat spamdexing.

As an example, people could previously create many message-board posts with links to their website to artificially inflate their PageRank. With the nofollow value, message-board administrators can modify their code to automatically insert "rel='nofollow'" to all hyperlinks in posts, thus preventing PageRank from being affected by those particular posts. This method of avoidance, however, also has various drawbacks, such as reducing the link value of legitimate comments. (See: Spam in blogs#nofollow)

In an effort to manually control the flow of PageRank among pages within a website, many webmasters practice what is known as PageRank Sculpting^{[48]}—which is the act of strategically placing the nofollow attribute on certain internal links of a website in order to funnel PageRank towards those pages the webmaster deemed most important. This tactic has been used since the inception of the nofollow attribute, but may no longer be effective since Google announced that blocking PageRank transfer with nofollow does not redirect that PageRank to other links.^{[49]}

## Deprecation

PageRank was once available for the verified site maintainers through the Google Webmaster Tools interface. However on October 15, 2009, a Google employee confirmed^{[50]} that the company had removed PageRank from its *Webmaster Tools* section, explaining that "We've been telling people for a long time that they shouldn't focus on PageRank so much. Many site owners seem to think it's the most important metric for them to track, which is simply not true."^{[50]} In addition, The PageRank indicator is not available in Google's own Chrome browser.

The visible page rank is updated very infrequently.

On 6 October 2011, many users mistakenly thought Google PageRank was gone. As it turns out, it was simply an update to the URL used to query the PageRank from Google.^{[51]}

Google now also relies on other strategies as well as PageRank, such as Google Panda.^{[52]}

## See also

- EigenTrust — a decentralized PageRank algorithm
- Google bomb
- Google Search
- Google matrix
- Google Panda
- VisualRank - Google's application of PageRank to image-search
- Hilltop algorithm
- Link love
- Methods of website linking
- Power method — the iterative eigenvector algorithm used to calculate PageRank
- Search engine optimization
- SimRank — a measure of object-to-object similarity based on random-surfer model
- Topic-Sensitive PageRank
- TrustRank
- Webgraph
- CheiRank
- Google Penguin
- Google Hummingbird

## Notes

## References

## Relevant patents

- Original PageRank U.S. Patent—Method for node ranking in a linked database—Patent number 6,285,999—September 4, 2001
- PageRank U.S. Patent—Method for scoring documents in a linked database—Patent number 6,799,176—September 28, 2004
- PageRank U.S. Patent—Method for node ranking in a linked database—Patent number 7,058,628—June 6, 2006
- PageRank U.S. Patent—Scoring documents in a linked database—Patent number 7,269,587—September 11, 2007

## External links

- Our Search: Google Technology by Google
- How Google Finds Your Needle in the Web's Haystack by the American Mathematical Society