## Abstract

It is known that the output from Google's PageRank algorithm may be interpreted as (a) the limiting value of a linear recurrence relation that is motivated by interpreting links as votes of confidence, and (b) the invariant measure of a teleporting random walk that follows links except for occasional uniform jumps. Here, we show that, for a sufficiently frequent jump rate, the PageRank score may also be interpreted as a mean finishing time for a reverse random walk. At a general step this new process either (i) remains at the current page, (ii) moves to a page that points to the current page, or (iii) terminates. The process is analogous to a game of pinball where a ball bounces between pages before eventually dropping down the exit chute. This new interpretation of PageRank gives another view of the principle that highly ranked pages will be those that are linked into by highly ranked pages that have relatively few outgoing links.

Original language | English |
---|---|

Pages (from-to) | 1359-1362 |

Number of pages | 3 |

Journal | Applied Mathematics Letters |

Volume | 18 |

Issue number | 12 |

DOIs | |

Publication status | Published - Dec 2005 |

## Keywords

- search algorithm
- page rank
- linear recurrence
- mathematics
- votes of confidence
- probability