Comparing series of rankings with ties by using complex networks: An analysis of the Spanish stock market (IBEX-35 index)

@article{Pedroche2014ComparingSO,
  title={Comparing series of rankings with ties by using complex networks: An analysis of the Spanish stock market (IBEX-35 index)},
  author={Francisco Pedroche and Regino Criado and Esther Garc{\'i}a and Miguel Romance and Victoria E. S{\'a}nchez},
  journal={Networks Heterog. Media},
  year={2014},
  volume={10},
  pages={101-125}
}
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 coefficient for two partial rankings to the concept of evolutive Kendall's coefficient for a series of partial rankings. The theoretical framework consists of a four-layer multiplex network. Regarding the treatment of ties, our approach allows to define a tie between two values when they are close {\em enough… 

Some rankings based on PageRank applied to the Valencia Metro

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 different

A biplex approach to PageRank centrality: From classic to multiplex networks.

This paper introduces a new centrality measure for classic complex networks and a new proposal to extend the usual PageRank algorithm to multiplex networks and gives some analytical relations between these new approaches and the classic PageRankcentrality measure.

Análise comparativa da competitividade do Campeonato Brasileiro de Futebol mediante redes complexas

A incerteza sobre os resultados de eventos esportivos tem sido a motivacao de muitos trabalhos em diversasareas de investigacao. Em especial, diversos campeonatos de futebol tem sido estudados

Corrected Evolutive Kendall’s τ Coefficients for Incomplete Rankings with Ties: Application to Case of Spotify Lists

Mathematical analysis of rankings is essential for a wide range of scientific, public, and industrial applications (e.g., group decision-making, organizational methods, R&D sponsorship, recommender

References

SHOWING 1-10 OF 49 REFERENCES

A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues

A new technique to analyze families of rankings based on sports rankings and, more precisely, on soccer leagues is shown, which gives a generalization of the Kendall's correlation coefficient to more than two rankings.

Tau-b or Not Tau-b: Measuring the Similarity of Foreign Policy Positions

The pattern of alliances among states is commonly assumed to reflect the extent to which states have common or conflicting security interests. For the past twenty years, Kendall's τ b has been used

Generalized distances between rankings

This work extends Spearman's footrule and Kendall's tau to those with position and element weights, and shows that a variant of the Diaconis-Graham inequality still holds - the generalized two measures remain within a constant factor of each other for all permutations.

On rank correlation and the distance between rankings

This work introduces an alternative measure of distance between rankings that corrects this by explicitly accounting for correlations between systems over a sample of topics, and moreover has a probabilistic interpretation for use in a test of statistical significance.

Distance-based and ad hoc consensus models in ordinal preference ranking

  • W. Cook
  • Economics
    Eur. J. Oper. Res.
  • 2006

A new rank correlation coefficient with application to the consensus ranking problem

The consensus ranking problem has received much attention in the statistical literature. Given m rankings of n objects the objective is to determine a consensus ranking. The input rankings may

Improved Bounds for Computing Kemeny Rankings

Improved bounding techniques are provided based on cycles in the pairwise majority graph, others are based on linear programs, and the relative strength of all of these bounds is characterized.

Partial Kernelization for Rank Aggregation: Theory and Experiments

This work studies efficient polynomial-time data reduction rules that allow us to find optimal median rankings and improves a result for a “partial problem kernel” from quadratic to linear size.

Aggregating inconsistent information: Ranking and clustering

This work almost settles a long-standing conjecture of Bang-Jensen and Thomassen and shows that unless NP⊆BPP, there is no polynomial time algorithm for the problem of minimum feedback arc set in tournaments.