On PageRank versatility for multiplex networks: properties and some useful bounds |
| |
| Authors: | Francisco Pedroche Regino Criado Julio Flores Esther García Miguel Romance |
| |
| Institution: | 1. Institut de Matemàtica Multidisciplinària, Universitat Politècnica de València, 46022 València, Spain;2. Departamento de Matemática Aplicada, Ciencia e Ingeniería de los Materiales y Tecnología Electrónica, ESCET Universidad Rey Juan Carlos, 28933 Móstoles (Madrid), Spain |
| |
| Abstract: | 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. |
| |
| Keywords: | versatility Laplacian matrices PageRank centrality measures multiplex networks |
|
|
