title: A biplex approach to PageRank centrality: From classic to multiplex networks.
abstract: In this paper, we present a new view of the PageRank algorithm inspired by multiplex networks. This new approach allows to introduce a new centrality measure for classic complex networks and a new proposal to extend the usual PageRank algorithm to multiplex networks. We give some analytical relations between these new approaches and the classic PageRank centrality measure, and we illustrate the new parameters presented by computing them on real underground networks.
authors.affiliation: Institut de Matemàtica Multidisciplinària, Universitat Politècnica de València, Valencia, Spain.
authors.forename: Francisco
authors.initials: F
authors.lastname: Pedroche
authors.affiliation: Department of Applied Mathematics, Rey Juan Carlos University, Madrid, Spain.
authors.forename: Miguel
authors.initials: M
authors.lastname: Romance
authors.affiliation: Department of Applied Mathematics, Rey Juan Carlos University, Madrid, Spain.
authors.forename: Regino
authors.initials: R
authors.lastname: Criado