Miguel Romance

According to our database1, Miguel Romance authored at least 36 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


Using complex networks to identify patterns in specialty mathematical language: a new approach.
Soc. Netw. Anal. Min., 2020

On the α-nonbacktracking centrality for complex networks: Existence and limit cases.
J. Comput. Appl. Math., 2019

On the spectrum of two-layer approach and Multiplex PageRank.
J. Comput. Appl. Math., 2018

Sharp estimates for the personalized Multiplex PageRank.
J. Comput. Appl. Math., 2018

On eigenvector-like centralities for temporal networks: Discrete vs. continuous time scales.
J. Comput. Appl. Math., 2018

Credit Card Fraud Detection through Parenclitic Network Analysis.
Complex., 2018

On graphs associated to sets of rankings.
J. Comput. Appl. Math., 2016

Comparing series of rankings with ties by using complex networks: An analysis of the Spanish stock market (IBEX-35 index).
Networks Heterog. Media, 2015

Efficient algorithms for estimating loss of information in a complex network: Applications to intentional risk analysis.
Networks Heterog. Media, 2015

Preface: "New trends, models and applications in complex and multiplex networks".
Networks Heterog. Media, 2015

Centralities of a network and its line graph: an analytical comparison by means of their irregularity.
Int. J. Comput. Math., 2014

The structure and dynamics of multilayer networks.
CoRR, 2014

Eigenvector centrality of nodes in multiplex networks.
CoRR, 2013

Comparing rankings by means of competitivity graphs: structural properties and computation.
CoRR, 2013

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

Structural properties of the line-graphs associated to directed networks.
Networks Heterog. Media, 2012

Preface: Mesoscales and evolution in complex networks: Applications and related topics.
Networks Heterog. Media, 2012

Interest point detection in images using complex network analysis.
J. Comput. Appl. Math., 2012

A mathematical model for networks with structures in the mesoscale.
Int. J. Comput. Math., 2012

A Post-Processing Method for Interest Point Location in Images by Using Weighted Line-Graph Complex Networks.
Int. J. Bifurc. Chaos, 2012

Int. J. Bifurc. Chaos, 2012

Emergence of network features from multiplexity
CoRR, 2012

Modeling the Multi-layer Nature of the European Air Transport Network: Resilience and Passengers Re-scheduling under random failures
CoRR, 2012

On the Localization of the Personalized PageRank of Complex Networks
CoRR, 2012

Local estimates for eigenvector-like centralities of complex networks.
J. Comput. Appl. Math., 2011

Analytical relationships between metric and centrality measures of a network and its dual.
J. Comput. Appl. Math., 2011

Controlling centrality in complex networks
CoRR, 2011

Hyperstructures, a New Approach to Complex Systems.
Int. J. Bifurc. Chaos, 2010

Evolutionary Games defined at the Network Mesoscale: The Public Goods game
CoRR, 2010

Improvements in performance and security for complex networks.
Int. J. Comput. Math., 2009

A Node-Based Multiscale Vulnerability of Complex Networks.
Int. J. Bifurc. Chaos, 2009

Int. J. Bifurc. Chaos, 2009

Vulnerability and Fall of Efficiency in Complex Networks: a New Approach with Computational Advantages.
Int. J. Bifurc. Chaos, 2009

Probabilistic analysis of efficiency and vulnerability in the Erdös-Rénji model.
Int. J. Comput. Math., 2008

Efficiency, Vulnerability and Cost: an Overview with Applications to Subway Networks Worldwide.
Int. J. Bifurc. Chaos, 2007

Effective measurement of network vulnerability under random and intentional attacks.
J. Math. Model. Algorithms, 2005