Nonlocal PageRank

DOI10.1051/M2AN/2020071MaRDI QIDQ6333650arXivFDO

Authors Stefano Cipolla, Fabio Durastante, Francesco Tudisco

Publication date 28 January 2020

Published in arXiv

Full work available at URL https://doi.org/10.1051/M2AN/2020071

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Internet topics (68M11)

arXiv classification

cs.NAcs.SImath.NAphysics.soc-ph

Abstract: 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 extit{long-range interaction} between them, does not exhibit concentration phenomena typical of spectral rankings which take into account just local interactions. We show that the predictive value of the rankings obtained using our proposals is considerably improved on different real world problems.

This page was built for publication: Nonlocal PageRank

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