Pasar al contenido principal

SISTEMAS DE JORDAN Y ALGEBRAS DE LIE

MTM2010-16153

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2010
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD DE OVIEDO
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 5
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Competitivity graphs analysis and structural comparison of rankings

  • Criado, Regino
  • García, Esther
  • Romance, Miguel
  • Sánchez-García, Victoria E.
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
[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 tools for analyzing an (ordered) family of rankings of a fixed set of elements. It is shown how the structural properties of these competitivity graphs give deep information about the competitiveness of the elements according to the rankings considered. The relationships between competitivity graphs and some other well-known families of graphs, such as permutation graphs, comparability graphs and chordal graphs are also presented. Finally some applications are presented, including the analysis of sports rankings and, more precisely, the study of European soccer leagues., This work was partially supported by Spanish MICINN Funds and FEDER Funds MTM2009-13848, MTM2010-16153 and MTM2010-18674, and Junta de Andalucía Funds FQM-264.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the localization of the personalized PageRank of complex networks

  • García, E
  • Romance, M
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
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 characterization of all the possible values of the personalized PageRank for any node.We use this result to give a theoretical justification of a recent model that uses the personalized PageRank to classify users of Social Networks Sites. We introduce new concepts concerning competitivity and leadership in complex networks. We also present some theoretical techniques to locate leaders and competitors which are valid for any personalization vector and by using only information related to the adjacency matrix of the graph and the distribution of its dangling nodes. © 2012 Elsevier Inc. All rights reserved., This paper was partially supported by Spanish MICINN Funds and FEDER Funds MTM2009-13848, MTM2010-16153 and MTM2010-18674, Rey Juan Carlos University Funds 13-2010/00075/001 and Junta de Andalucia Funds FQM-264. The authors would like to thank Prof. Regino Criado, who worked in a previous version of this paper, and the referee for their valuable comments and remarks.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

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

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Criado, Regino
  • García, Esther Higueras
  • Romance, Miguel
  • Sánchez, Victoria E.
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 concept of evolutive Kendall's coe cient 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 de ne a tie between two values when they are close enough, depending on a threshold. We show an application using data from the Spanish Stock Market; we analyse the series of rankings de ned by 25 companies that have contributed to the IBEX-35 return and volatility values over the period 2003 to 2013., This work was partially supported by Spanish MICINN Funds and FEDER Funds MTM2009-13848, MTM2010-16153 and MTM2010-18674, and Junta de Andalucia Funds FQM-264. The authors would like to thank the referees for their valuable comments and remarks.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

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

  • Criado Herrero, Regino
  • García González, Esther
  • Romance, Miguel
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
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 positions in consecutive rankings. This allows to define a graph by linking teams that compete. We show how to use some structural properties of this competitivity graph to measure to what extend the teams in a league compete. These structural properties are the mean degree, the mean strength, and the clustering coefficient. We give a generalization of the Kendall's correlation coefficient to more than two rankings. We also show how to make a dynamic analysis of a league and how to compare different leagues. We apply this technique to analyze the four major European soccer leagues: Bundesliga, Italian Lega, Spanish Liga, and Premier League. We compare our results with the classical analysis of sport ranking based on measures of competitive balance., This paper was partially supported by Spanish MICINN Funds and FEDER Funds MTM2009-13848, MTM2010-16153 and MTM2010-18674, and Junta de Andalucia Funds FQM-264.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On graphs associated to sets of rankings

  • Criado Herrero, Regino
  • García, Esther
  • Romance, Miguel
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
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 positions in at least two rankings, and we can associate an undirected graph to a set of rankings by connecting elements that compete. We call this graph a competitivity graph. Competitivity graphs have already appeared in the literature as co-comparability graphs, f-graphs or intersection graphs associated to a concatenation of permutation diagrams. We 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. These sets are analyzed and a method to obtain sets of eventual competitors directly from a set of rankings is shown. © 2015 Elsevier B.V., This paper was partially supported by Spanish MICINN Funds and FEDER Funds MTM2009-13848, MTM2010-16153 and MTM2010-18674, and Junta de Andalucia Funds FQM-264. The authors would like to thank an anonymous referee for the valuable comments and remarks.