Premium
On PageRank versatility for multiplex networks: properties and some useful bounds
Author(s) -
Pedroche Francisco,
Criado Regino,
Flores Julio,
García Esther,
Romance Miguel
Publication year - 2020
Publication title -
mathematical methods in the applied sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.719
H-Index - 65
eISSN - 1099-1476
pISSN - 0170-4214
DOI - 10.1002/mma.6274
Subject(s) - pagerank , multiplex , measure (data warehouse) , focus (optics) , ranking (information retrieval) , mathematics , computer science , theoretical computer science , node (physics) , laplace operator , matrix (chemical analysis) , data mining , information retrieval , mathematical analysis , bioinformatics , physics , structural engineering , optics , biology , engineering , materials science , composite material
In this paper, some results concerning the PageRank versatility measure for multiplex networks are given. This measure extends to the multiplex setting the well‐known classic PageRank. Particularly, we focus on some spectral properties of the Laplacian matrix of the multiplex and on obtaining boundaries for the ranking value of a given node when some personalization vector is added, as in the classic setting.