Personalized PageRank with node-dependent restart

DOI10.1007/978-3-319-13123-8_3MaRDI QIDQ6826186zbMATH OpenFDO

Authors Konstantin Avrachenkov, Remco van der Hofstad, Marina Sokol

Publication date 9 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13123-8_3

zbMATH Keywords

constant restart probability

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(3)

• Fully personalized PageRank and algebraic methods to distribute a random walker
• Mean first-encounter times of simultaneous random walkers with resetting on networks
• Queues with service resetting

This page was built for publication: Personalized PageRank with node-dependent restart

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826186)