36 citations · 49 across the 6 of their papers we have counts for
6 papers
Comparing series of rankings with ties by using complex networks: An analysis of the spanish stock market (IBEX-35 index)
F. Pedroche, R. Criado, E. Garcia +2
In this paper we extend the concept of Competitivity Graph to compare series of rankings with ties ({\em partial rankings}). We extend the usual method used to compute Kendall's co…
Comparing rankings by means of competitivity graphs: structural properties and computation
Regino Criado, Esther Garcia, Francisco Pedroche +1
In this paper we introduce a new technique to analyze families of rankings focused on the study of structural properties of a new type of graphs. Given a finite number of elements…
On the convergence of weighted-average consensus
Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa +1
In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of t…
A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues
Regino Criado, Esther Garcia, Francisco Pedroche +1
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…
On the Localization of the Personalized PageRank of Complex Networks
Esther Garcia, Francisco Pedroche, Miguel Romance
In this paper new results on personalized PageRank are shown. We consider directed graphs that may contain dangling nodes. The main result presented gives an analytical characteriz…
L-RCM: a method to detect connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm
Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa +1
In this paper we consider undirected graphs with no loops and multiple edges, consisting of k connected components. In these cases, it is well known that one can find a numbering o…