Generic Damping Functions for Propagating Importance in Link-Based Ranking

DOI10.1080/15427951.2006.10129134zbMath1147.68325OpenAlexW2029953931MaRDI QIDQ3519886

Carlos Castillo, Paolo Boldi, Ricardo A. Baeza-Yates

Publication date: 19 August 2008

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2006.10129134

zbMATH Keywords

link-based ranking algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (5)

Random Surfing Without Teleportation ⋮ Network Capacity Bound for Personalized PageRank in Multimodal Networks ⋮ Choose the damping, choose the ranking? ⋮ Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph ⋮ PageRank Beyond the Web

This page was built for publication: Generic Damping Functions for Propagating Importance in Link-Based Ranking