Publication:266693

DOI10.1007/978-3-319-13123-8_3zbMath1342.60123arXiv1408.0719OpenAlexW2115741288MaRDI 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

zbMATH Keywords

Markov processespersonalized PageRank algorithmrenewal-reward theoremrestartconstant restart probability

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Graph algorithms (graph-theoretic aspects) (05C85) Information storage and retrieval of data (68P20) Renewal theory (60K05) Internet topics (68M11)

Related Items (3)

Analysis of Relaxation Time in Random Walk with Jumps ⋮ Discrete-time random walks and Lévy flights on arbitrary networks: when resetting becomes advantageous? ⋮ Similarities on graphs: kernels versus proximity measures

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