3 ms·
> If you take a long enough walk in a (strongly connected) graph, the probability of ending up in a particular place becomes independent of your starting point.
by gertef 12y ago
> If you take a long enough walk in a (strongly connected) graph, the probability of ending up in a particular place becomes independent of your starting point.
And this was the foundation of Google's PageRank.
http://en.wikipedia.org/wiki/Google_matrix http://en.wikipedia.org/wiki/Google_matrix
- murbard2 12y agoIndeed. However, it's easy to miss the "random-walk" aspect of pagerank if one simply think of it as a recursive relation between inbound and outbound links. Once you think "random-walk" you can build a whole class of "intentional surfer" model which model surfers seeking particular information.