GOOGLE PAGE RANK ALGORITHM 1

INTRODUCTION

In early 90’s when Internet was developed by Vinton Cerf (now the Vice
President and Chief Internet Evangelist for Google) and ARPANET, there where
only limited number of pages on Internet. Searches at that time were precise as
there were very few results. But as internet grew the searching became more
tedious. Very relevant in present scenario to single out a page from millions of
pages on internet.The searched page must be of the users choice,It should match
the relevancy criteria's of the user.Should provide the results in split second.An
official Web Site of NIT Calicut (www.nitc.com)has the following Search
Tags:Engineering College, Calicut,Education Kerala, Engineering Colleges in
Kerala, B Tech, Computer Science…etc.And There had been a search for
“Engineering Colleges in Kerala” and the offical web site has 50 occurrences of
this search Tag.Which is the first result in the search engine. A Web search engine
is a tool designed to search for information on the World Wide Web. Information
may consist of web pages, images, information and other types of files. Some
search engines also mine data available in newsbooks, databases, or open
directories. Google search is a Web search engine owned by Google, Inc., and is
the most used search engine on the Web. Google receives several hundred million
queries each day through its various services

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 2

PRESENT SCENARIO

Showdown
Claim
Search Engine Estimate
(millions)
(millions)
Google 3,033 3,083
AlltheWeb 2,106 2,116
AltaVista 1,689 1,000
WiseNut 1,453 1,500
Hotbot 1,147 3,000
MSN Search 1,018 3,000
Teoma 1,015 500
NLResearch 733 125
Gigablast 275 150

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 3

FOUNDERS OF GOOGLE

1) SERGEY BRIN

President of Technology at Google

Russian-born American Entrepreneur

25th richest person in the world

Master's degree in Computer Science at Stanford University.

2) LARRY PAGE

President of Products at Google

American entrepreneur

Ph.D. program in computer science at Stanford University

26th richest person in the world

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 4

HISTORY

PageRank was developed at Stanford University by Larry Page (hence the name
Page-Rank) and later Sergey Brin as part of a research project about a new kind of
search engine. The project started in 1995 and led to a functional prototype, named
Google, in 1998. Shortly after, Page and Brin founded Google Inc., the company
behind the Google search engine. While just one of many factors which determine the
ranking of Google search results, PageRank continues to provide the basis for all of
Google's web search tools.

PageRank is based on citation analysis that was developed in the 1950s by Eugene
Garfield at the University of Pennsylvania, and Google's founders cite Garfield's work
in their original paper. By following links from one page to another, virtual
communities of webpages are found

A Survey of Google's PageRank

Within the past few years, Google has become the far most utilized search
engine worldwide. A decisive factor therefore was, besides high performance and ease
of use, the superior quality of search results compared to other search engines. This
quality of search results is substantially based on PageRank, a sophisticated method to
rank web documents.The aim of these pages is to provide a broad survey of all aspects
of PageRank. The contents of these pages primarily rest upon papers by Google
founders Lawrence Page and Sergey Brin from their time as graduate students at
Stanford University.It is often argued that, especially considering the dynamic of the
internet, too much time has passed since the scientific work on PageRank, as that it
still could be the basis for the ranking methods of the Google search engine. There is
no doubt that within the past years most likely many changes, adjustments and
modifications regarding the ranking methods of Google have taken place, but
PageRank was absolutely crucial for Google's success, so that at least the fundamental
concept behind PageRank should still be constitutive.

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 5

The PageRank Concept

Since the early stages of the world wide web, search engines have developed
different methods to rank web pages. Until today, the occurence of a search phrase
within a document is one major factor within ranking techniques of virtually any
search engine. The occurence of a search phrase can thereby be weighted by the
length of a document (ranking by keyword density) or by its accentuation within a
document by HTML tags.
For the purpose of better search results and especially to make search engines
resistant against automatically generated web pages based upon the analysis of
content specific ranking criteria (doorway pages), the concept of link popularity was
developed. Following this concept, the number of inbound links for a document
measures its general importance. Hence, a web page is generally more important, if
many other web pages link to it. The concept of link popularity often avoids good
rankings for pages which are only created to deceive search engines and which don't
have any significance within the web, but numerous webmasters elude it by creating
masses of inbound links for doorway pages from just as insignificant other web pages.
Contrary to the concept of link popularity, PageRank is not simply based upon
the total number of inbound links. The basic approach of PageRank is that a document
is in fact considered the more important the more other documents link to it, but those
inbound links do not count equally. First of all, a document ranks high in terms of
PageRank, if other high ranking documents link to it.
So, within the PageRank concept, the rank of a document is given by the rank
of those documents which link to it. Their rank again is given by the rank of
documents which link to them. Hence, the PageRank of a document is always
determined recursively by the PageRank of other documents. Since - even if marginal
and via many links - the rank of any document influences the rank of any other,
PageRank is, in the end, based on the linking structure of the whole web. Although
this approach seems to be very broad and complex, Page and Brin were able to put it
into practice by a relatively trivial algorithm.

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 6

The Google Pagerank Algorithm and How It Works

Page Rank is a topic much discussed by Search Engine Optimisation (SEO) experts.
At the heart of PageRank is a mathematical formula that seems scary to look at but is
actually fairly simple to understand.

Despite this many people seem to get it wrong! In particular “Chris Ridings of
www.searchenginesystems.net” has written a paper entitled “PageRank Explained:
Everything you’ve always wanted to know about PageRank”, pointed to by many
people, that contains a fundamental mistake early on in the explanation!
Unfortunately this means some of the recommendations in the paper are not quite
accurate.

By showing code to correctly calculate real PageRank I hope to achieve several things
in this response.In other words, a PageRank results from a "ballot" among all the
other pages on the World Wide Web about how important a page is. 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 there is no support for that page.

Google assigns a numeric weighting from 0-10 for each webpage on the Internet; this
PageRank denotes a site’s importance in the eyes of Google. The PageRank is derived
from a theoretical probability value on a logarithmic scale like the Richter Scale. 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. It is known that other factors,
e.g. relevance of search words on the page and actual visits to the page reported by the
Google toolbar also influence the PageRank.[ In order to prevent manipulation,
spoofing and Spamdexing, Google provides no specific details about how other
factors influence PageRankNumerous academic papers concerning PageRank have
been published since Page and Brin's original paper In practice, the PageRank concept
has proven to be vulnerable to manipulation, and extensive research has been devoted
to identifying falsely inflated PageRank and ways to ignore links from documents
with falsely inflated PageRank.

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 7

PageRank is a link analysis algorithm used by the Google Internet search engine that
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 also called the PageRank of E and denoted by PR(E).

The name "PageRank" is a trademark of Google, and the PageRank process has been
patented (U.S. Patent 6,285,999). However, the patent is assigned to Stanford
University and not to Google. Google has exclusive license rights on the patent from
Stanford University. The university received 1.8 million shares in Google in exchange
for use of the patent

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 between 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

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 8

Simplified algorithm
How PageRank Works

Assume a small universe of four web pages: A, B, C and D. The initial approximation
of PageRank would be evenly divided between these four documents. Hence, each
document would begin with an estimated PageRank of 0.25.

In the original form of PageRank initial values were simply 1. This meant that the
sum of all pages was the total number of pages on the web. Later versions of
PageRank (see the below formulas) would assume a probability distribution between
0 and 1. Here we're going to simply use a probability distribution hence the initial
value of 0.25.

If pages B, C, and D each only link to A, they would each confer 0.25 PageRank to A.
All PageRank PR( ) in this simplistic system would thus gather to A because all links
would be pointing to A.

This is 0.75.

Again, suppose page B also has a link to page C, and page D has links to all three
pages. The value of the link-votes is divided among all the outbound links on a page.
Thus, page B gives a vote worth 0.125 to page A and a vote worth 0.125 to page C.
Only one third of D's PageRank is counted for A's PageRank (approximately 0.083).

In other words, the PageRank conferred by an outbound link L( ) is equal to the

document's own PageRank score divided by the normalized number of outbound links
(it is assumed that links to specific URLs only count once per document).

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

i.e. the PageRank value for a page u is dependent on the PageRank values for each
page v out of the set Bu (this set contains all PAGES linking to page u), divided by the
number L(v) of links from page v.

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 9

The PageRank Display of the Google Toolbar

FIG (1): -DISPLAY OF GOOGLE TOOLBAR

PageRank became widely known by the PageRank display of the Google Toolbar. The
Google Toolbar is a browser plug-in for Microsoft Internet Explorer which can be
downloaded from the Google web site. The Google Toolbar provides some features
for searching Google more comfortably.
The Google Toolbar displays PageRank on a scale from 0 to 10. First of all, the
PageRank of an actually visited page can be estimated by the width of the green bar
within the display. If the user holds his mouse over the display, the Toolbar also shows
the PageRank value. Caution: The PageRank display is one of the advanced features
of the Google Toolbar. And if those advanced features are enabled, Google collects
usage data. Additionally, the Toolbar is self-updating and the user is not informed
about updates. So, Google has access to the user's hard drive.

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 10

Relationship Between Three Pages

B C
FIG(2):-RELATIONSHIP BETWEEN THREE PAGES

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 11

PageRank (A)

B C
FIG(3):-PAGE RANK(A)

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 12

PageRank (B)

B C

FIG (4):-PAGE RANK (B)

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 13

A Different Notation of the PageRank Algorithm

Lawrence Page and Sergey Brin have published two different versions of their
PageRank algorithm in different papers. In the second version of the algorithm, the
PageRank of page A is given as
PR(A) = (1-d) / N + d (PR(T1)/C(T1) + ... + PR(Tn)/C(Tn))
where N is the total number of all pages on the web. The second version of the
algorithm, indeed, does not differ fundamentally from the first one. Regarding the
Random Surfer Model, the second version's PageRank of a page is the actual
probability for a surfer reaching that page after clicking on many links. The
PageRanks then form a probability distribution over web pages, so the sum of all
pages' PageRanks will be one.
Contrary, in the first version of the algorithm the probability for the random surfer
reaching a page is weighted by the total number of web pages. So, in this version
PageRank is an expected value for the random surfer visiting a page, when he restarts
this procedure as often as the web has pages. If the web had 100 pages and a page had
a PageRank value of 2, the random surfer would reach that page in an average twice if
he restarts 100 times.
As mentioned above, the two versions of the algorithm do not differ fundamentally
from each other. A PageRank which has been calculated by using the second version
of the algorithm has to be multiplied by the total number of web pages to get the
according PageRank that would have been caculated by using the first version. Even
Page and Brin mixed up the two algorithm versions in their most popular paper "The
Anatomy of a Large-Scale Hypertextual Web Search Engine", where they claim the
first version of the algorithm to form a probability distribution over web pages with
the sum of all pages' PageRanks being one.

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 14

FIG(5):-MATHEMATICAL PAGE RANK

Mathematical PageRanks (out of 100) for a simple network (PageRanks reported by

Google are rescaled logarithmically). Page C has a higher PageRank than Page E,
even though it has fewer links to it: the link it has is much higher valued. A web surfer
who chooses a random link on every page (but with 15% likelihood jumps to a
random page on the whole web) is going to be on Page E for 8.1% of the time. (The
15% likelihood of jumping to an arbitrary page corresponds to a damping factor of
85%.) Without damping, all web surfers would eventually end up on Pages A, B, or C,
and all other pages would have PageRank zero. Page A is assumed to link to all pages
in the web, because it has no outgoing links.

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 15

CONCLUSION

Google with its PageRank has come a great way in serving students, researchers,
business class and every other. Google no longer just trawls the web for us,
keyword by keyword. It offers free email space, messaging services, maps,
satellite photos, a way to search books and academic papers and much more. And
all these services uses PageRank to analyze the behavior of people over the
Internet, helping Google in providing content relevant ads.

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE

 GOOGLE PAGE RANK ALGORITHM 16

REFERENCES

1. en.wikipedia.org/wiki/PageRank
2. pr.efactory.de/e-pagerank-algorithm.shtml
3. www.markhorrell.com/seo/pagerank.html
4. www.ianrogers.net/google-page-rank

NEHRU COLLEGE OF ENGINEERING AND RESEARCH CENTRE