Construct · 1 fields · 3 citations

PageRank: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaningretrievalcompare the meanings
How to read this

Every construct on the map is compared with every other by the meaning of its definitions, and the closest one is surfaced here. The nearest construct to PageRank is retrieval.

Hold this as a prompt, not a verdict. Two constructs sitting close in meaning is a reason to read them side by side and decide for yourself whether they are one idea under two names. It is not proof that they are. Compare the meanings in the Collider.

PageRank1 CONSTRUCTPageRankBRIN & PAGE · WEB RANK

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms and network science

A link-based importance score for nodes in a directed graph

Sergey Brin and Lawrence Page (1998) introduced PageRank in their description of the Google search prototype, and Page, Brin, Motwani, and Winograd (1999) set it out in full as a method for ranking web pages by the structure of their links. The core idea is recursive: a page is treated as important when many pages, and especially other important pages, link to it, so a page's score depends on the scores of the pages pointing to it. The authors made this precise with a random-surfer model, imagining someone who follows links at random and now and then jumps to a random page (a step governed by a damping factor), where a page's PageRank is the long-run probability of landing on it, known as the stationary distribution of that random walk over the link graph. Because the score is defined purely on the link graph and reduces to the dominant eigenvector of the graph's transition matrix, it applies to any directed network, and it served as the original ranking signal behind Google web search and has since been reused in citation analysis, biology, and social-network studies.[1][2][3]

Unit
A per-node probability score assigned to every node of the graph, summing to one across the network
Recovery means
Not applicable
Measured by
Computed as the dominant eigenvector of the graph's damped transition matrix, typically by power iteration repeated until the scores converge

Next

Run it through the Collider, or take the citations with you.

See how PageRank sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

network4 fields · 6 citationsjingle · one word, four constructscentrality4 fields · 7 citationsjingle · one word, four constructsMarkov chain1 fields · 3 citationsanchor · a standalone construct

References

  1. Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1–7), 107–117. https://doi.org/10.1016/S0169-7552(98)00110-X
  2. Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: Bringing order to the Web (Technical Report No. SIDL-WP-1999-0120). Stanford InfoLab.
  3. Langville, A. N., & Meyer, C. D. (2006). Google's PageRank and beyond: The science of search engine rankings. Princeton University Press.

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct