Nonlocal PageRank

01/28/2020
by   Stefano Cipolla, et al.
0

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 exhibit concentration phenomena typical for spectral rankings taking 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/11/2022

Rankings in the Zerkani network by a game theoretical approach

This paper introduces the Banzhaf and Banzhaf-Owen values as novel centr...
05/13/2019

Consequential Ranking Algorithms and Long-term Welfare

Ranking models are typically designed to provide rankings that optimize ...
12/05/2016

Proportional Rankings

In this paper we extend the principle of proportional representation to ...
05/29/2020

Network-based ranking in social systems: three challenges

Ranking algorithms are pervasive in our increasingly digitized societies...
06/29/2018

GOTO Rankings Considered Helpful

Rankings are a fact of life. Whether or not one likes them, they exist a...
11/14/2017

Ranking of nodes of networks taking into account the power function of its weight of connections

To rank nodes in quasi-hierarchical networks of social nature, it is nec...
10/31/2018

MDFS - MultiDimensional Feature Selection

Identification of informative variables in an information system is ofte...

Code Repositories

NonLocalPageRank

Matlab codes for the NonLocalPageRank Algorithm


view repo