Approximating PageRank from In-Degree

DOI10.1007/978-3-540-78808-9_6zbMath1142.68311OpenAlexW1543136715MaRDI QIDQ3520031

Santo Fortunato, Filippo Menczer, Marián Boguñá, Alessandro Flammini

Publication date: 19 August 2008

Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78808-9_6

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Information storage and retrieval of data (68P20)

Related Items (14)

Ranking in evolving complex networks ⋮ The PageRank vector of a scale-free web network growing by preferential attachment ⋮ Random walks and diffusion on networks ⋮ A biplex approach to PageRank centrality: From classic to multiplex networks ⋮ Heuristical top-\(k\): fast estimation of centralities in complex networks ⋮ Random walk centrality for temporal networks ⋮ Algorithmic bias amplification via temporal effects: the case of PageRank in evolving networks ⋮ Tackling information asymmetry in networks: a new entropy-based ranking index ⋮ Asymptotic analysis for personalized Web search ⋮ On the edges’ PageRank and line graphs ⋮ Determining Factors Behind the PageRank Log-Log Plot ⋮ Local dependency in networks ⋮ Parametric controllability of the personalized PageRank: Classic model vs biplex approach ⋮ Pagerank asymptotics on directed preferential attachment networks

Cites Work

• Determining Factors Behind the PageRank Log-Log Plot
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating PageRank from In-Degree