Zobrazeno 1 - 10
of 193
pro vyhledávání: '"Romance, Miguel"'
In this paper we explore the PageRank of temporal networks on both discrete and continuous time scales in the presence of personalization vectors that vary over time. Also the underlying interplay between the discrete and continuous settings arising
Externí odkaz:
http://arxiv.org/abs/2407.06198
The study of hypergraphs has received a lot of attention over the past few years, however up until recently there has been no interest in systems where higher order interactions are not undirected. In this article we introduce the notion of heterogen
Externí odkaz:
http://arxiv.org/abs/2403.11825
Spectral analysis of networks states that many structural properties of graphs, such as centrality of their nodes, are given in terms of their adjacency matrices. The natural extension of such spectral analysis to higher order networks is strongly li
Externí odkaz:
http://arxiv.org/abs/2310.20335
Publikováno v:
Chaos 33, 083152 (2023)
The significance of the PageRank algorithm in shaping the modern Internet cannot be overstated, and its Complex Network theory foundations continue to be a subject of research. In this article we carry out a systematic study of the structural and par
Externí odkaz:
http://arxiv.org/abs/2211.12929
Autor:
Samoylenko, Ivan, Aleja, David, Primo, Eva, Alfaro-Bittner, Karin, Vasilyeva, Ekaterina, Kovalenko, Kirill, Musatov, Daniil, Raigorodskii, Andreii M., Criado, Regino, Romance, Miguel, Papo, David, Perc, Matjaz, Barzel, Baruch, Boccaletti, Stefano
Publikováno v:
Phys. Rev. X 13, 021032 (2023)
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 network
Externí odkaz:
http://arxiv.org/abs/2211.09463
The search for linguistic patterns, stylometry and forensic linguistics have in the theory of complex networks, their structures and associated mathematical tools, allies with which to model and analyze texts. In this paper we present a new model sup
Externí odkaz:
http://arxiv.org/abs/2207.09400
Publikováno v:
In Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena October 2024 187
Autor:
Garcia, Esther, Romance, Miguel
In this paper some results about the controllability of spectral centrality in a complex network are presented. In particular, the inverse problem of designing an unweigthed graph with a prescribed centrality is considered, by showing that for every
Externí odkaz:
http://arxiv.org/abs/2111.01473
Autor:
Kovalenko, Kirill, Romance, Miguel, Vasilyeva, Ekaterina, Aleja, David, Criado, Regino, Musatov, Daniil, Raigorodskii, Andrei M., Flores, Julio, Samoylenko, Ivan, Alfaro-Bittner, Karin, Perc, Matjaz, Boccaletti, Stefano
Publikováno v:
Chaos, Solitons & Fractals 162, 112397 (2022)
Identifying the most influential nodes in networked systems is of vital importance to optimize their function and control. Several scalar metrics have been proposed to that effect, but the recent shift in focus towards network structures which go bey
Externí odkaz:
http://arxiv.org/abs/2108.13846
Autor:
Partida, Alberto, Gerassis, Saki, Criado, Regino, Romance, Miguel, Giráldez, Eduardo, Taboada, Javier
Publikováno v:
In Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena December 2022 165 Part 2