Generalisation of the Damping Factor in PageRank for Weighted Networks

DOI10.1007/978-3-319-06653-0_19zbMath1341.68135OpenAlexW66280366MaRDI QIDQ3193136

Sergei D. Silvestrov, Christopher Engström

Publication date: 15 October 2015

Published in: EAA Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06653-0_19

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Related Items (4)

Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes ⋮ Perturbed Markov chains with damping component ⋮ PageRank for networks, graphs, and Markov chains ⋮ Coupling and ergodic theorems for Markov chains with damping component

Cites Work

• The mathematics of internet search engines
• Adaptive methods for the computation of PageRank
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalisation of the Damping Factor in PageRank for Weighted Networks