Skip to main content

ANALISIS ESTRUCTURAL DE SISTEMAS REALES MODELADOS COMO REDES COMPLEJAS UTILIZANDO TECNICAS ESPECTRALES Y DINAMICA

MTM2014-59906-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSIDAD REY JUAN CARLOS

Resultados relacionados

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

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

Some rankings based on PageRank applied to the Valencia Metro

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Romance, Miguel
  • Criado, Regino
[EN] In this paper we apply a recent model of Multiplex PageRank to the multiplex network formed with the 9 lines of the metro of Valencia (Spain). We compute the PageRank vector following di erent approaches and we compare the results with those recently obtained for the Madrid metro system., This work has been partially supported by the project MTM2014-59906 (Spanish Ministry) and the grant URJC-Grupo de Excelencia Investigadora GARECOM (2014-2016).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Sharp estimates for the personalized Multiplex PageRank

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • García, Esther
  • Romance, Miguel
  • Criado Herrero, Regino
[EN] PageRank can be understood as the stationary distribution of a Markov chain that occurs in a two-layer network with the same set of nodes in both layers: the physical layer and the teleportation layer. In this paper we present some bounds for the extension of this two-layer approach to Multiplex networks, establishing sharp estimates for this Multiplex PageRank and locating the possible values of the personalized PageRank for each node of a network. Several examples are shown to compare the values obtained for both algorithms, the classic and the two-layer PageRank. (C) 2017 Elsevier B.V. All rights reserved., This work has been partially supported by the projects MTM2014-59906-P, MTM2014-52470-P (Spanish Ministry) and the grant Grupo de excelencia investigadora URJC-Banco de Santander GARECOM 30VCPIGI11. The authors would like to thank an anonymous referee for his/her valuable comments and remarks that have improved the readability of the manuscript.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication 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.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A biplex approach to PageRank centrality: from classic to multiplex networks

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Romance, Miguel
  • Criado Herrero, Regino
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. © 2016 Author(s)., This work has been partially supported by the project MTM2014-59906 (Spanish Ministry) and the Grant URJC-Grupo de Excelencia Investigadora GARECOM (2014-2016).
BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
Publication Artículo científico (JournalArticle)

On the Spectrum of two-layer approach and Multiplex PageRank

  • Pedroche, Francisco
  • Criado, Regino
  • García, Esther
  • Romance, Miguel
En este trabajo presentamos algunos resultados sobre el espectro de la matriz asociada al cálculo del PageRank Multiplex definido por los autores en un trabajo anterior. Estos resultados pueden considerarse una extensión natural de los resultados conocidos sobre el espectro de la matriz de Google. En concreto, demostramos que los valores propios de la matriz de transición asociada a la red multiplexada pueden deducirse a partir de los valores propios de una matriz en bloque que contiene las matrices estocásticas definidas para cada capa. También demostramos que, como ocurre en el PageRank clásico, el espectro no se ve afectado por los vectores de personalización definidos en cada capa, sino que depende del parámetro α que controla el teletransporte. También mostramos algunas relaciones analíticas entre los valores propios e incluimos algunos pequeños ejemplos que ilustran los principales resultados., 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.