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 ...
[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 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 ...