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 eigenvalue problem was suggested in 1976 by Gabriel Pinski and Francis Narin, who worked on scientometrics ranking scientific journals, in 1977 by Thomas Saaty in his concept of Analytic Hierarchy Processwhich weighted alternative choices, and in 1995 by

 ...

The PageRank algorithm outputs a probability distributionused to represent the likelihood that a person randomly clicking on links will arrive at any particular page. PageRank can be

 ...

PageRank of an undirected graph
The PageRank of an undirected graph is statistically close to the degree distribution of the graph , but they are generally not identical: If is the PageRank vector defined above, and is the degree distribution vector

 ...

The mathematics of PageRank are entirely general and apply to any graph or network in any domain. Thus, PageRank is now regularly used in bibliometrics, social and information network

 ...

In early 2005, Google implemented a new value, "nofollow", for the rel attribute of HTML link and anchor elements, so that website developers and bloggerscan make links that Google will not consider for the purposes of PageRank—they are links that no longer constitute a

 ...

Katja Mayer views PageRank as a social network as it connects differing viewpoints and thoughts in a single place. People go to PageRank for information and are flooded with citationsof other authors who also have an opinion on the topic. This creates a

 ...