Xavier Molinero

Dr. Xavier Molinero

orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018 in Knowledge-Based Systems
Verified
Journal Article
Open access
Fabián RiquelmeFabián Riquelme
Fabián Riquelme
PGPablo Gonzalez-Cantergiani
Pablo Gonzalez-Cantergiani
XMXavier Molinero
Xavier Molinero
MSMaria Serna
Maria Serna
Centrality and influence spread are two of the most studied concepts in social network analysis. In recent years, centrality measures have attracted the attention of many researchers, generating a large and varied number of new studies about social network analysis and its applications. However, as far as we know, traditional models of influence spread have not yet been exhaustively used to define centrality measures according to the influence criteria. Most of the considered work in this topic is based on the independent cascade model. In this paper we explore the possibilities of the linear threshold model for the definition of centrality measures to be used on weighted and labeled social networks. We propose a new centrality measure to rank the users of the network, the Linear Threshold Rank (LTR), and a centralization measure to determine to what extent the entire network has a centralized structure, the Linear Threshold Centralization (LTC). We appraise the viability of the approach through several case studies. We consider four different social networks to compare our new measures with two centrality measures based on relevance criteria and another centrality measure based on the independent cascade model. Our results show that our measures are useful for ranking actors and networks in a distinguishable way.Peer ReviewedPostprint (author's final draft

1 April 2010 in Optimization Methods and Software
Verified
Journal Article
Closed access
JFJosep Freixas
Josep Freixas
XMXavier Molinero
Xavier Molinero
Isbell in 1959 was the first to find a weighted game without a minimum integer realization in which the affected players do not play a symmetric role in the game. His example has 12 players in a weighted decisive game, i.e. a weighted game for which a coalition wins iff its complement loses. The goal of this article is to provide a procedure for weighted games that allows finding out what is the minimum number of players needed to get a weighted game without a minimum integer weighted representation in which the affected players do not play a symmetric role in the game. We prove, by means of an algorithm, that the minimum number of voters required is nine.

24 September 2008 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
JFJosep Freixas
Josep Freixas
XMXavier Molinero
Xavier Molinero

1 February 2021 in Computer Science Review
Verified
Journal Article
Closed access
XMXavier Molinero
Xavier Molinero
Fabián RiquelmeFabián Riquelme
Fabián Riquelme

1 April 2009 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
JFJosep Freixas
Josep Freixas
XMXavier Molinero
Xavier Molinero

1 May 2015 in European Journal of Operational Research
Verified
Journal Article
Closed access
XMXavier Molinero
Xavier Molinero
Fabián RiquelmeFabián Riquelme
Fabián Riquelme
MSMaria Serna
Maria Serna