Dirichlet pagerank and trust-based ranking algorithms

Authors:
Fan Chung;Alexander Tsiatas;Wensong Xu
Affiliations:
Department of Computer Science and Engineering, University of California, San Diego;Department of Computer Science and Engineering, University of California, San Diego;Department of Computer Science and Engineering, University of California, San Diego
Venue:
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Year:
2011

Citing 10
Cited 1

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Discrete Green's functions

Journal of Combinatorial Theory Series A
Scaling personalized web search

WWW '03 Proceedings of the 12th international conference on World Wide Web
The Eigentrust algorithm for reputation management in P2P networks

WWW '03 Proceedings of the 12th international conference on World Wide Web
Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search

IEEE Transactions on Knowledge and Data Engineering
Propagation of trust and distrust

Proceedings of the 13th international conference on World Wide Web
Sybilproof reputation mechanisms

Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Combating web spam with trustrank

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Trust-based recommendation systems: an axiomatic approach

Proceedings of the 17th international conference on World Wide Web
A novel approach to propagating distrust

WINE'10 Proceedings of the 6th international conference on Internet and network economics

Spectral analysis of communication networks using Dirichlet eigenvalues

Proceedings of the 22nd international conference on World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by numerous models of representing trust and distrust within a graph ranking system, we examine a quantitative vertex ranking with consideration of the influence of a subset of nodes. An efficient algorithm is given for computing Dirichlet PageRank vectors subject to Dirichlet boundary conditions on a subset of nodes. We then give several algorithms for various trust-based ranking problems using Dirichlet PageRank with boundary conditions, showing several applications of our algorithms.