Dirichlet PageRank and trust-based ranking algorithms

DOI10.1007/978-3-642-21286-4_9MaRDI QIDQ3005575zbMATH OpenOpenAlexFDO

Authors Alexander Tsiatas, Wensong Xu, Fan Chung

Publication date 8 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21286-4_9

Mathematics Subject Classification ID

Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Dirichlet PageRank and ranking algorithms based on trust and distrust
• From eigentrust to a trust-measuring algorithm in the max-plus algebra
• PageRank optimization by edge selection
• Non-backtracking PageRank
• Ranking nodes in general networks: a Markov multi-chain approach

Cited in

(7)

• On the exponential ranking and its linear counterpart
• PageRank beyond the web
• From eigentrust to a trust-measuring algorithm in the max-plus algebra
• Dirichlet PageRank and ranking algorithms based on trust and distrust
• A rankclass-based algorithm for the web trust analysis
• Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem
• A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings

This page was built for publication: Dirichlet PageRank and trust-based ranking algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3005575)