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. The numerical weight that it assigns to any given element E is referred to as the PageRank of E and denoted by P R ( E ). The algorithm may be applied to any collection of entities with reciprocal quotations and references.

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. As of September 24, 2019, PageRank and all associated patents are expired. Ĭurrently, PageRank is not the only algorithm used by Google to order search results, but it is the first algorithm that was used by the company, and it is the best known. The underlying assumption is that more important websites are likely to receive more links from other websites. PageRank works by counting the number and quality of links to a page to determine a rough estimate of how important the website is. PageRank is a way of measuring the importance of website pages.

It is named after both the term 'web page' and co-founder Larry Page.

PageRank ( PR) is an algorithm used by Google Search to rank web pages in their search engine results.

The percentage shows the perceived importance, and the arrows represent hyperlinks. A simple illustration of the Pagerank algorithm.

Page ranking checker