Comparing rankings by means of competitivity graphs: structural properties and computation

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 and a family of rankings of those elements, we say that two elements compete when they exchange their relative positions in at least two rankings. This allows us to define an undirected graph by connecting elements that compete. We call this graph a competitivity graph. We study the relationship of competitivity graphs with other well-known families of graphs, such as permutation graphs, comparability graphs and chordal graphs. In addition to this, we also introduce certain important sets of nodes in a competitivity graph. For example, nodes that compete among them form a competitivity set and nodes connected by chains of competitors form a set of eventual competitors. We analyze hese sets and we show a method to obtain sets of eventual competitors directly from a family of rankings.

[1]  Wayne Goddard,et al.  Distance and connectivity measures in permutation graphs , 2003, Discret. Math..

[2]  Francisco Pedroche,et al.  A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues , 2013, Chaos.

[3]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[4]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[5]  Wojciech A. Trybulec.  Partially Ordered Sets , 1990 .

[6]  Hon-Chan Chen,et al.  An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs , 1995, Inf. Process. Lett..

[7]  Kurt Mehlhorn,et al.  Certifying algorithms for recognizing interval graphs and permutation graphs , 2003, SODA '03.

[8]  Xiaotie Deng,et al.  On the complexity of crossings in permutations , 2009, Discret. Math..

[9]  Youngmee Koh,et al.  Connected permutation graphs , 2007, Discret. Math..

[10]  R. Graham,et al.  Spearman's Footrule as a Measure of Disarray , 1977 .

[11]  A. Lempel,et al.  Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[12]  M. Kendall.  A NEW MEASURE OF RANK CORRELATION , 1938 .

[13]  William I. Gasarch.  Review of "Handbook of Graph Theory edited by Gross and Yellen." CRC, 2004. , 2004, SIGA.

[14]  David J. Hand,et al.  Who's #1? The science of rating and ranking , 2012 .

[15]  Xiaotie Deng,et al.  Crossings and Permutations , 2005, Graph Drawing.

[16]  Severino V. Gervacio,et al.  Characterization and Construction of Permutation Graphs , 2013 .

[17]  Judit Bar-Ilan,et al.  Comparing rankings of search results on the Web , 2005, Inf. Process. Manag..

[18]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[19]  Jorge Urrutia,et al.  Comparability graphs and intersection graphs , 1983, Discret. Math..

[20]  F. Harary,et al.  Planar Permutation Graphs , 1967 .

[21]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[22]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.