Braintique.com header
Left Navigation Bar

Chapter 11: Using Google’s Comparative Methodology to Your Advantage



In the chapter:
  • The scope of the information available on the Web
  • Evaluating information obtained on the Web
  • Understanding and using taxonomies
  • The implications of the PageRank algorithm

Content from the chapter
  • Learn how Google works, and what mechanisms it uses to respond to search queries

Getting inside the heads of random surfers

The PageRank formula can be thought of as a model of user behavior of “random surfers.” Such a random surfer visits a random Web page, keeps clicking links randomly, never clicking the back button, and eventually gets bored enough to visit a new random page by typing in the Web address into the browser. The probability that the random surfer visits a particular page is its PageRank. The probability at each page that the random surfer will get bored and request a new random page is called the damping factor¸ represented by d in the formula.

Put this way, the PageRank for a specific Web page can clearly be calculated by going through all the inbound links to a page, calculating the PageRanks of all these pages, backing up to calculate the inbound links in turn to the new set of pages, and so on, all the way back until there are no more inbound links. A little more technically, a Web page’s PageRank can be calculated by iterating recursively through all of its inbound linked pages. This is the fundamental method behind Google’s search engine, although in the real world (as you likely know if you’ve read this far in this sidebar) there are usually non-recursive techniques that calculate results more quickly than the corresponding recursive algorithm.
.
The original formula for PageRank with further explanation is contained in the Brin and Page page. Here it is (PR stands for PageRank; A stands for a random page, identified as Page A; T1...Tn signifies all the pages that link to Page A; C(A) represents the number of Page A’s outbound links):

PR(A) = (1-d) + d(PR(T1)/C(T1) + ... + d(PR(Tn)/C(Tn)

PageRanks form a probability distribution over Web pages, so the sum of all Web pages’ PageRanks is one. The formula for PageRank has, of course, evolved since this formulation, and its exact nature is at this point part of Google’s proprietary technology.

For more material that helps you understand how Google works and how to make the best use of it, please see Chapter 11...
Links from the chapter:

Chapters Book Table of Contents Research resources


Google
 
Web www.braintique.com
www.digitalfieldguide.com www.googleplexblog.com


Home | Barticles | Blogs | Books | Services | FAQ | Contact

© Braintique.com. All rights reserved.

Search Engine Optimization







RSS 2.0 Syndication feed

Syndication Viewer

Our Web host:
IX WebHosting



Food for Your Brain! Get a Barticle! Questions Answered Books for You What We Can Do For You Contact Us Brain Food Questions Answered Books for You What We Can Do For You Frequently Asked Questions About Us Google Research Photoshop Wi-Fi and Wireless Networking The Natural Way to Write