Miguel Romance
Orcid: 0000-0001-9259-9716
According to our database1,
Miguel Romance
authored at least 43 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Time-dependent Personalized PageRank for temporal networks: discrete and continuous scales.
CoRR, 2024
J. Complex Networks, 2024
Proceedings of the European Interdisciplinary Cybersecurity Conference, 2024
2023
Entropy, June, 2023
2022
CoRR, 2022
2020
Using complex networks to identify patterns in specialty mathematical language: a new approach.
Soc. Netw. Anal. Min., 2020
2019
J. Comput. Appl. Math., 2019
2018
J. Comput. Appl. Math., 2018
J. Comput. Appl. Math., 2018
On eigenvector-like centralities for temporal networks: Discrete vs. continuous time scales.
J. Comput. Appl. Math., 2018
2016
2015
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
Networks Heterog. Media, 2015
2014
Centralities of a network and its line graph: an analytical comparison by means of their irregularity.
Int. J. Comput. Math., 2014
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
2012
Networks Heterog. Media, 2012
Preface: Mesoscales and evolution in complex networks: Applications and related topics.
Networks Heterog. Media, 2012
J. Comput. Appl. Math., 2012
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
Modeling the Multi-layer Nature of the European Air Transport Network: Resilience and Passengers Re-scheduling under random failures
CoRR, 2012
2011
J. Comput. Appl. Math., 2011
Analytical relationships between metric and centrality measures of a network and its dual.
J. Comput. Appl. Math., 2011
2010
CoRR, 2010
2009
Int. J. Comput. Math., 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
2008
Int. J. Comput. Math., 2008
2007
Efficiency, Vulnerability and Cost: an Overview with Applications to Subway Networks Worldwide.
Int. J. Bifurc. Chaos, 2007
2005
J. Math. Model. Algorithms, 2005