Pasar al contenido principal

SISTEMAS DE JORDAN, ALGEBRAS DE LIE Y REDES COMPLEJAS

MTM2017-84194-P

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D (Excelencia / Generación de Conocimiento)
Año convocatoria 2017
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD REY JUAN CARLOS

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Parametric controllability of the personalized PageRank: Classic model vs biplex approach

  • Flores, Julio
  • García, Esther
  • Romance, Miguel
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
[EN] Measures of centrality in networks defined by means of matrix algebra, like PageRank-type centralities, have been used for over 70 years. Recently, new extensions of PageRank have been formulated and may include a personalization (or teleportation) vector. It is accepted that one of the key issues for any centrality measure formulation is to what extent someone can control its variability. In this paper, we compare the limits of variability of two centrality measures for complex networks that we call classic PageRank (PR) and biplex approach PageRank (BPR). Both centrality measures depend on the so-called damping parameter alpha that controls the quantity of teleportation. Our first result is that the intersection of the intervals of variation of both centrality measures is always a nonempty set. Our second result is that when alpha is lower that 0.48 (and, therefore, the ranking is highly affected by teleportation effects) then the upper limits of PR are more controllable than the upper limits of BPR; on the contrary, when alpha is greater than 0.5 (and we recall that the usual PageRank algorithm uses the value 0.85), then the upper limits of PR are less controllable than the upper limits of BPR, provided certain mild assumptions on the local structure of the graph. Regarding the lower limits of variability, we give a result for small values of alpha. We illustrate the results with some analytical networks and also with a real Facebook network., This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities under Project Nos. PGC2018-101625-B-I00, MTM2016-76808-P, and MTM2017-84194-P (AEI/FEDER, UE).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On PageRank versatility for multiplex networks: properties and some useful bounds

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Criado, Regino
  • Flores, Julio
  • García, Esther
  • Romance, Miguel
[EN] 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., This work has been partially supported by the projects MTM2017-84194-P (Ministerio de Ciencia y Tecnología, AEI/FEDER, UE) and PGC2018-101625B-100 (Ministerio de Ciencia y Tecnología, AEI/FEDER, UE).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the spectrum of two-layer approach and Multiplex PageRank

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • García, Esther
  • Romance, Miguel
  • Criado Herrero, Regino
[EN] In this paper, we present some results about the spectrum of the matrix associated with the computation of the Multiplex PageRank defined by the authors in a previous paper. These results can be considered as a natural extension of the known results about the spectrum of the Google matrix. In particular, we show that the eigenvalues of the transition matrix associated with the multiplex network can be deduced from the eigenvalues of a block matrix containing the stochastic matrices defined for each layer. We also show that, as occurs in the classic PageRank, the spectrum is not affected by the personalization vectors defined on each layer but depends on the parameter a that controls the teleportation. We also give some analytical relations between the eigenvalues and we include some small examples illustrating the main results. (C) 2018 Elsevier B.V. All rights reserved., We thank the two anonymous reviewers for their constructive comments, which helped us to improve the manuscript. This work has been partially supported by the projects MTM2014-59906-P, MTM2014-52470-P (Spanish Ministry and FEDER, EU, Spain), MTM2017-84194-P (AEI/FEDER, EU, Spain) and the grant URJC-Grupo de Excelencia Investigadora GARECOM (2014-2017), Spain.