Web search engine: Science
Principles
The science it rests on, with why each principle matters to it
Relies on- Graph theory The web is a graph of pages joined by links, and Brin and Page used this citation graph to rank pages [3].
- Probability and statistics PageRank is the probability that a random surfer clicking links lands on a page [3], a Markov chain [7].
as of 2026-11-11
Discoveries
The discoveries that made it possible: when, by whom and what was found
| Year | Who | What |
|---|---|---|
| 1736 | Leonhard Euler | Solved the bridges of Königsberg problem, the start of what is now called graph theory [8] |
| 1906 | Andrei Markov | First work on chains of dependent random events, now called Markov chains [7] |
as of 2026-11-11
The science explained
The science behind it explained for a curious reader
Imagine a bored surfer who starts on a random web page and keeps clicking links at random, now and then jumping to a fresh random page. After a long time, how often will the surfer be on each page? Pages that many others link to, especially pages that are themselves often visited, come up more often. That share of time is the PageRank of a page [3]. Mathematically it is a Markov chain, a process in which the next step depends only on where you are now, an idea Markov began in 1906 [7]. The web is the graph, the pages are its points and the links its lines, the kind of structure Euler first reasoned about in 1736 [8].
as of 2026-11-11
Sources
- The Anatomy of a Large-Scale Hypertextual Web Search Engine (Sergey Brin and Lawrence Page, Stanford University) Engineering and Technology History Wiki (copy of the paper)
- First Links in the Markov Chain American Scientist (Brian Hayes), vol. 101, no. 2, 2013
- Leonard Euler's Solution to the Konigsberg Bridge Problem Mathematical Association of America, Convergence (Teo Paoletti)