Personalized PageRank with Node-dependent Restart
Konstantin Avrachenkov (INRIA Sophia Antipolis), Remco W. Van Der, Hofstad, Marina Sokol (INRIA Sophia Antipolis)

TL;DR
This paper introduces two novel generalizations of Personalized PageRank with node-dependent restart probabilities, providing new insights into their properties and relationships, including symmetry between direct and reverse measures.
Contribution
The paper proposes two new node-dependent restart schemes for Personalized PageRank and derives their elegant mathematical relationships and symmetry properties.
Findings
Both generalizations unify with the original when restart probability is constant.
Derived symmetry property links direct and reverse Personalized PageRanks.
Discussed special cases of restart probabilities and distributions.
Abstract
Personalized PageRank is an algorithm to classify the improtance of web pages on a user-dependent basis. We introduce two generalizations of Personalized PageRank with node-dependent restart. The first generalization is based on the proportion of visits to nodes before the restart, whereas the second generalization is based on the probability of visited node just before the restart. In the original case of constant restart probability, the two measures coincide. We discuss interesting particular cases of restart probabilities and restart distributions. We show that the both generalizations of Personalized PageRank have an elegant expression connecting the so-called direct and reverse Personalized PageRanks that yield a symmetry property of these Personalized PageRanks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInformation Retrieval and Search Behavior · Text and Document Classification Technologies · Complex Network Analysis Techniques
