Dirichlet PageRank and Ranking Algorithms Based on Trust and Distrust

Motivated by numerous models of representing trust and distrust within a network ranking system, we examine a quantitative vertex ranking with consideration of the influence of a subset of nodes. We propose and analyze a general ranking metric, called Dirichlet PageRank, which gives a ranking of vertices in a subset S of nodes subject to some specified conditions on the vertex boundary of S. In addition to the usual Dirichlet boundary condition (which disregards the influence of nodes outside of S), we consider general boundary conditions allowing the presence of negative (distrustful) nodes or edges. We give an efficient approximation algorithm for computing Dirichlet PageRank vectors. Furthermore, we give several algorithms for solving various trust-based ranking problems using Dirichlet PageRank with general boundary conditions.

[1]  Taher H. Haveliwala.  Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search , 2003, IEEE Trans. Knowl. Data Eng..

[2]  K. E. Read,et al.  Cultures of the Central Highlands, New Guinea , 1954, Southwestern Journal of Anthropology.

[3]  Adam Tauman Kalai,et al.  Trust-based recommendation systems: an axiomatic approach , 2008, WWW.

[4]  Fan Chung Graham,et al.  A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification , 2010, WAW.

[5]  Amy Nicole Langville,et al.  Google's PageRank and beyond - the science of search engine rankings , 2006 .

[6]  Ramanathan V. Guha,et al.  Propagation of trust and distrust , 2004, WWW '04.

[7]  Hector Garcia-Molina,et al.  Combating Web Spam with TrustRank , 2004, VLDB.

[8]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[9]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[10]  Ricardo A. Baeza-Yates,et al.  Pagerank Increase under Different Collusion Topologies , 2005, AIRWeb.

[11]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[12]  András A. Benczúr,et al.  SpamRank -- Fully Automatic Link Spam Detection , 2005, AIRWeb.

[13]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[14]  Paul Van Dooren,et al.  The PageTrust Algorithm: How to rank web pages when negative links are allowed? , 2008, SDM.

[15]  F. Harary,et al.  Structural Models in Anthropology , 1986 .

[16]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[17]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[18]  Adam Tauman Kalai,et al.  A Novel Approach to Propagating Distrust , 2010, WINE.

[19]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[20]  W. Marsden.  I and J , 2012 .

[21]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[22]  Alice Cheng,et al.  Sybilproof reputation mechanisms , 2005, P2PECON '05.

[23]  Shing-Tung Yau,et al.  Discrete Green's Functions , 2000, J. Comb. Theory A.

[24]  F. Chung.  PageRank as a discrete Green ’ s function , 2008 .