A Local Updating Algorithm for Personalized PageRank via Chebyshev Polynomials

Esteban Bautista (1) , Matthieu Latapy (1)

1 ComplexNetworks

The personalized PageRank algorithm is one of the most versatile tools for the analysis of networks. In spite of its ubiquity, maintaining personalized PageRank vectors when the underlying network constantly evolves is still a challenging task. To address this limitation, this work proposes a novel distributed algorithm to locally update personalized PageRank vectors when the graph topology changes. The proposed algorithm is based on the use of Chebyshev polynomials and a novel update equation that encompasses a large family of PageRank-based methods. In particular, the algorithm has the following advantages: (i) it has faster convergence speed than state-of-the-art alternatives for local PageRank updating; and (ii) it can update the solution of recent generalizations of PageRank for which no updating algorithms have been developed. Experiments in a real-world temporal network of an autonomous system validate the effectiveness of the proposed algorithm.

Domaines: Réseaux sociaux et d'information [cs.SI]; Informatique [cs]; Traitement du signal et de l'image [eess.SP]

Esteban Bautista, Matthieu Latapy. A Local Updating Algorithm for Personalized PageRank via Chebyshev Polynomials. Social Network Analysis and Mining, 2022, 12 (1), ⟨10.1007/s13278-022-00860-5⟩. ⟨hal-03367113⟩