Nonlocal PageRank
ESAIM: Mathematical Modelling and Numerical Analysis, vol. 55, pp. 77–97, 2021
In this work we introduce and study a nonlocal version of the PageRank. In our approach, the random walker explores the graph using longer excursions than just moving between neighboring nodes. As a result, the corresponding ranking of the nodes, which takes into account a long-range interaction between them, does not …