Eva Primo

Eva Primo

Auto-generated profile, based on publicly available information

Eva Primo

Departamento de Matemática Aplicada, Ciencia e Ingeniería de los Materiales y Tecnología Electrónica, Universidad Rey Juan Carlos 1 , 28933 Móstoles (Madrid), Spain

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
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 August 2024 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
PDF file
DADavid Aleja
David Aleja
JFJulio Flores
Julio Flores
EPEva Primo
Eva Primo
MRMiguel Romance
Miguel Romance
In this paper, we explore the PageRank of temporal networks (networks that evolve with time) with time-dependent personalization vectors. We consider both continuous and discrete time intervals and show that the PageRank of a continuous-temporal network can be nicely estimated by the PageRanks of the discrete-temporal networks arising after sampling. Additionally, precise boundaries are given for the estimated influence of the personalization vector on the ranking of a particular node. All ingredients in the classic PageRank definition, namely, the normalized matrix collecting the topology of the network, the damping factor, and the personalization vector are allowed, to the best of our knowledge, for the first time in the literature to vary independently with time. The theoretical results are illustrated by means of some real and synthetic examples.

1 November 2017 in Journal of Mathematical Analysis and Applications
Verified
Journal Article
Closed access
CFCarmen Fernández
Carmen Fernández
AGAntonio Galbis
Antonio Galbis
EPEva Primo
Eva Primo