Personalized PageRank with node-dependent restart
DOI10.1007/978-3-319-13123-8_3zbMath1342.60123arXiv1408.0719MaRDI QIDQ266693
Remco van der Hofstad, Marina Sokol, Konstantin E. Avrachenkov
Publication date: 13 April 2016
Published in: Lecture Notes in Computer Science, Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.0719
Markov processes; personalized PageRank algorithm; renewal-reward theorem; restart; constant restart probability
60J22: Computational methods in Markov chains
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
65C40: Numerical analysis or methods applied to Markov chains
05C85: Graph algorithms (graph-theoretic aspects)
68P20: Information storage and retrieval of data
60K05: Renewal theory
68M11: Internet topics
