Approximating PageRank from In-Degree
From MaRDI portal
Publication:3520031
DOI10.1007/978-3-540-78808-9_6zbMath1142.68311MaRDI 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
68M10: Network design and communication in computer systems
68U35: Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)
68P20: Information storage and retrieval of data
Related Items
A biplex approach to PageRank centrality: From classic to multiplex networks, On the edges’ PageRank and line graphs, Random walk centrality for temporal networks, Parametric controllability of the personalized PageRank: Classic model vs biplex approach, Determining Factors Behind the PageRank Log-Log Plot, Local dependency in networks, Random walks and diffusion on networks, Tackling information asymmetry in networks: a new entropy-based ranking index, Pagerank asymptotics on directed preferential attachment networks, The PageRank vector of a scale-free web network growing by preferential attachment, Algorithmic bias amplification via temporal effects: the case of PageRank in evolving networks, Ranking in evolving complex networks, Heuristical top-\(k\): fast estimation of centralities in complex networks, Asymptotic analysis for personalized Web search
Cites Work
