Miguel Romance

Prof. Dr. Miguel Romance

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
23 February 2021 in Nature Communications
Verified
Journal Article
Open access
PDF file
LGL. V. Gambuzza
L. V. Gambuzza
FPFrancesca Di Patti
Francesca Di Patti
LGL. Gallo
L. Gallo
SLS. Lepri
S. Lepri
MRMiguel Romance
Miguel Romance
Stefano BoccalettiStefano Boccaletti
Stefano Boccaletti
Various systems in physics, biology, social sciences and engineering have been successfully modeled as networks of coupled dynamical systems, where the links describe pairwise interactions. This is, however, too strong a limitation, as recent studies have revealed that higher-order many-body interactions are present in social groups, ecosystems and in the human brain, and they actually affect the emergent dynamics of all these systems. Here, we introduce a general framework to study coupled dynamical systems accounting for the precise microscopic structure of their interactions at any possible order. We show that complete synchronization exists as an invariant solution, and give the necessary condition for it to be observed as a stable state. Moreover, in some relevant instances, such a necessary condition takes the form of a Master Stability Function. This generalizes the existing results valid for pairwise interactions to the case of complex systems with the most general possible architecture.

29 January 2013 in The European Physical Journal Special Topics
Verified
Journal Article
Closed access
PDF file
ACAlessio Cardillo
Alessio Cardillo
Massimiliano ZaninMassimiliano Zanin
Massimiliano Zanin
JGJesús Gomez Gardeñes
Jesús Gomez Gardeñes
MRMiguel Romance
Miguel Romance
AAAlejandro J. García del Amo
Alejandro J. García del Amo
SBStefano Boccaletti
Stefano Boccaletti

1 January 2018 in Complexity
Verified
Journal Article
Open access
PDF file
MZMassimiliano Zanin
Massimiliano Zanin
MRMiguel Romance
Miguel Romance
SMSantiago Moral
Santiago Moral
RCRegino Criado
Regino Criado
The detection of frauds in credit card transactions is a major topic in financial research, of profound economic implications. While this has hitherto been tackled through data analysis techniques, the resemblances between this and other problems, like the design of recommendation systems and of diagnostic/prognostic medical tools, suggest that a complex network approach may yield important benefits. In this paper we present a first hybrid data mining/complex network classification algorithm, able to detect illegal instances in a real card transaction data set. It is based on a recently proposed network reconstruction algorithm that allows creating representations of the deviation of one instance from a reference group. We show how the inclusion of features extracted from the network data representation improves the score obtained by a standard, neural network‐based classification algorithm and additionally how this combined approach can outperform a commercial fraud detection system in specific operation niches. Beyond these specific results, this contribution represents a new example on how complex networks and data mining can be integrated as complementary tools, with the former providing a view to data beyond the capabilities of the latter.

1 September 2019 in Chaos, Solitons & Fractals
Verified
Journal Article
Closed access
DADavid Aleja
David Aleja
RCRegino Criado
Regino Criado
AAAlejandro J. García del Amo
Alejandro J. García del Amo
ÁPÁngel Pérez
Ángel Pérez
MRMiguel Romance
Miguel Romance

31 May 2023 in Physical Review X
Verified
Journal Article
Open access
PDF file
ISI. Samoylenko
I. Samoylenko
DAD. Aleja
D. Aleja
EPE. Primo
E. Primo
KAK. Alfaro-Bittner
K. Alfaro-Bittner
EVEkaterina Vasilyeva
Ekaterina Vasilyeva
SBS. Boccaletti
S. Boccaletti
A wealth of evidence shows that real-world networks are endowed with the small-world property, i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most social networks are organized so that no individual is more than six connections apart from any other, an empirical regularity known as the six degrees of separation. Why social networks have this ultrasmall-world organization, whereby the graph’s diameter is independent of the network size over several orders of magnitude, is still unknown. We show that the “six degrees of separation” is the property featured by the equilibrium state of any network where individuals weigh between their aspiration to improve their centrality and the costs incurred in forming and maintaining connections. We show, moreover, that the emergence of such a regularity is compatible with all other features, such as clustering and scale-freeness, that normally characterize the structure of social networks. Thus, our results show how simple evolutionary rules of the kind traditionally associated with human cooperation and altruism can also account for the emergence of one of the most intriguing attributes of social networks.

1 January 2015
Verified
Book
Closed access
VCVictor Chapela
Victor Chapela
RCRegino Criado
Regino Criado
SMSantiago Moral
Santiago Moral
MRMiguel Romance
Miguel Romance