Pedroche Sánchez, Francisco; Romance, Miguel; Criado Herrero, Regino(American Institute of Physics, 2016-06-02)
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 ...
Criado Herrero, Regino; García González, Esther; Pedroche Sánchez, Francisco; Romance, Miguel(American Institute of Physics (AIP), 2013-10-31)
In this paper, we show a new technique to analyze families of rankings. In particular, we focus on sports rankings and, more precisely, on soccer leagues. We consider that two teams compete when they change their relative ...
Pedroche Sánchez, Francisco; Criado, Regino; García, Esther Higueras; Romance, Miguel; Sánchez, Victoria E.(American Institute of Mathematical Sciences (AIMS), 2015-03)
In this paper we extend the concept of Competitivity Graph to
compare series of rankings with ties (partial rankings). We extend the usual
method used to compute Kendall's coe cient for two partial rankings to the
...
[EN] A complex networks based method is introduced for comparing different complete rankings of a finite family of elements. The concepts of competitivity graph and evolutive competitivity graph are introduced as the main ...
[EN] A general growth model of random networks based on centrality measures is introduced. This formalism extends the well-known models of preferential attachment. We propose to set the preferential attachment using a ...
In this paper we analyze families of rankings by studying structural properties of graphs. Given a finite number of elements and a set of rankings of those elements, two elements compete when they exchange their relative ...
[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 ...
[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 ...
Flores, Julio; García, Esther; Pedroche Sánchez, Francisco; Romance, Miguel(American Institute of Physics, 2020-02)
[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 ...
[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 ...
[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 ...