Choose the damping, choose the ranking?

DOI10.1016/j.jda.2009.11.001zbMath1214.05160OpenAlexW2046264398MaRDI QIDQ972362

Marco Bressan, Enoch Peserico

Publication date: 25 May 2010

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2009.11.001

zbMATH Keywords

graphrankingwebpageranklink analysisdamping factorciteseer

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Mixing time of PageRank surfers on sparse random digraphs ⋮ Ranking nodes in general networks: a Markov multi-chain approach

Uses Software

• WebGraph

Cites Work

• A Singular Perturbation Approach for Choosing the PageRank Damping Factor
• Authoritative sources in a hyperlinked environment
• Generic Damping Functions for Propagating Importance in Link-Based Ranking
• Ordinal Ranking for Google's PageRank
• Deeper Inside PageRank
• HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
• Paradoxical Effects in PageRank Incremental Computations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Choose the damping, choose the ranking?