Skip to main content

OPERADORES LAPLACIANOS EN GRAFOS Y REDES CON REPULSORES/ATRACTORES Y DINAMICAS RELACIONADAS

PID2019-107603GB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE ZARAGOZA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 10
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

The world-wide waste web

  • Martínez, Johann H.
  • Romero, Sergi
  • Ramasco, José J.
  • Estrada, Ernesto
Globally, 7-10 billion tonnes of waste are produced annually, including 300-500 million tonnes of hazardous wastes (HW)--explosive, flammable, toxic, corrosive, and infective ones. About 10 % of these HW are traded through a world-wide waste web (W4). The volume of HW traded through the W4 in the last 30 years has grown by 500 % and will continue to grow, creating serious legal, economic, environmental and health problems at global scale. Here we investigate the tip of the iceberg of the W4 by studying networks of 108 categories of wastes traded among 163 countries in the period 2003-2009. Although, most of the HW were traded between developed nations, a disproportionate asymmetry existed in the flow of waste from developed to developing countries. Using a dynamical model we simulate how waste congestion propagates through the W4. We identify 32 countries with poor environmental performance which are at high risk of waste congestion. Therefore, they are a threat of improper handling and disposal of HW. We found contamination by heavy metals (HM), by volatile organic compounds (VOC) and/or by persistent organic pollutants (POP), which were used as chemical fingerprints (CF) of the improper handling of HW in 94 % of these countries., The authors thank funding from the project from the Spanish Ministry of Science and Innovation, the AEI and FEDER (EU) under the Maria de Maeztu program for Units of Excellence in R&D (MDM-2017-0711) as well as J. Gómez-Garde ̃nes, M. Chavez, J.J. Ramasco and A. Martínez for important suggestions. J.H.M. thanks the Colombian Ministry of Science, Technology and Innovation, Colciencias Call #811. E.E. thanks financial support from Ministerio de Ciencia, Innovacion y Universidades, Spain for the grant PID2019-107603GB-100., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Where to cut to delay a pandemic with minimum disruption? Mathematical analysis based on the SIS model

  • Bartesaghi, Paolo
  • Estrada, Ernesto
The problem of modifying a network topology in such a way as to delay the propagation of a disease with minimal disruption of the network capacity to reroute goods/items/passengers is considered here. We find an approximate solution to the Susceptible-Infected-Susceptible (SIS) model, which constitutes a tight upper bound to its exact solution. This upper bound allows direct structure-epidemic dynamic relations via the total communicability function. Using this approach we propose a strategy to remove edges in a network that significantly delays the propagation of a disease across the network with minimal disruption of its capacity to deliver goods/items/passengers. We apply this strategy to the analysis of the U.K. airport transportation network weighted by the number of passengers transported in the year 2003. We find that the removal of all flights connecting four origin-destination pairs in the U.K. delays the propagation of a disease by more than 300\%, with a minimal deterioration of the transportation capacity of this network. These time delays in the propagation of a disease represent an important non-pharmaceutical intervention to confront an epidemics, allowing for better preparations of the health systems, while keeping the economy moving with minimal disruptions., The author thanks financial support from Ministerio de Ciencia, Innovacion y Universidades, Spain for the grant PID2019-107603GB-I00 ”Hubs-repelling/ attracting Laplacian operators and related dynamics on graphs/networks”., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Hubs-biased resistance distances on graphs and networks

  • Estrada, Ernesto
  • Mugnolo, Delio
We define and study two new kinds of ``effective resistances'' based on hubs-biased --hubs-repelling and hubs-attracting -- models of navigating a graph/network. We prove that these effective resistances are squared Euclidean distances between the vertices of a graph. They can be expressed in terms of the Moore-Penrose pseudoinverse of the hubs-biased Laplacian matrices of the graph. We define the analogous of the Kirchhoff indices of the graph based of these resistance distances. We prove several results for the new resistance distances and the Kirchhoff indices based on spectral properties of the corresponding Laplacians. After an intensive computational search we conjecture that the Kirchhoff index based on the hubs-repelling resistance distance is not smaller than that based on the standard resistance distance, and that the last is not smaller than the one based on the hubs-attracting resistance distance. We also observe that in real-world brain and neural systems the efficiency of standard random walk processes is as high as that of hubs-attracting schemes. On the contrary, infrastructures and modular software networks seem to be designed to be navigated by using their hubs., The work of D.M. was supported by the Deutsche Forschungsgemeinschaft (Grant 397230547). EE thanks financial support from Ministerio de Ciencia, Innovacion y Universidades, Spain for the grant PID2019-107603GB-I00 “Hubs-repelling/attracting Laplacian operators and related dynamics on graphs/networks”. Both authors acknowledge that this article is based upon work from COST Action CA18232 MAT-DYN-NET, supported by COST (European Cooperation in Science and Technology), www.cost.eu., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Loss of structural balance in stock markets

  • Ferreira, Eva
  • Orbe, Susan
  • Ascorbebeitia, Jone
  • Álvarez Pereira, Brais
  • Estrada, Ernesto
We use rank correlations as distance functions to establish the interconnectivity between stock returns, building weighted signed networks for the stocks of seven European countries, the US and Japan. We establish the theoretical relationship between the level of balance in a network and stock predictability, studying its evolution from 2005 to the third quarter of 2020. We find a clear balance-unbalance transition for six of the nine countries, following the August 2011 Black Monday in the US, when the Economic Policy Uncertainty index for this country reached its highest monthly level before the COVID-19 crisis. This sudden loss of balance is mainly caused by a reorganization of the market networks triggered by a group of low capitalization stocks belonging to the non-financial sector. After the transition, the stocks of companies in these groups become all negatively correlated between them and with most of the rest of the stocks in the market. The implied change in the network topology is directly related to a decrease in stocks predictability, a finding with novel important implications for asset allocation and portfolio hedging strategies., E.F., S.O., and J.A. were supported by the Spanish Ministry of the Economy and Competitiveness under grant ECO2014-51914-P; the UPV/EHU under grants BETS-UFI11/46, MACLAB-IT93-13 and PES20/44; and the Basque Government under BiRTE-IT1336-19. J.A. also acknowledges financial support under PIF16/87 from UPV/EHU. E.E. thanks partial financial support from from Ministerio de Ciencia, Innovacion y Universidades, Spain, grant PID2019-107603GB-I00., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

From networked SIS model to the Gompertz function

  • Estrada, Ernesto
  • Bartesaghi, Paolo
The Gompertz function is one of the most widely used models in the description of growth processes in many different fields. We obtain a networked version of the Gompertz function as a worst-case scenario for the exact solution to the SIS model on networks. This function is shown to be asymptotically equivalent to the classical scalar Gompertz function for sufficiently large times. It proves to be very effective both as an approximate solution of the networked SIS equation within a wide range of the parameters involved and as a fitting curve for the most diverse empirical data. As an instance, we perform some computational experiments, applying this function to the analysis of two real networks of sexual contacts. The numerical results highlight the analogies and the differences between the exact description provided by the SIS model and the upper bound solution proposed here, observing how the latter amplifies some empirically observed behaviors such as the presence of multiple and successive peaks in the contagion curve., E.E. thanks Grant PID2019-107603GB-I00 by MCIN/AEI/10.13039/501100011033., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Non-uniform random graphs on the plane: A scaling study

  • Martínez Martínez, C. T.
  • Méndez-Bermúdez, J. A.
  • Rodrigues, Francisco A.
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where n vertices are independently distributed in the unit disc with positions, in polar coordinates (l,θ), obeying the probability density functions ρ(l) and ρ(θ). Here we choose ρ(l) as a normal distribution with zero mean and variance σ∈(0,∞) and ρ(θ) as an uniform distribution in the interval θ∈[0,2π). Then, two vertices are connected by an edge if their Euclidian distance is less or equal than the connection radius ℓ. We characterize the topological properties of this random graph model, which depends on the parameter set (n,σ,ℓ), by the use of the average degree ⟨k⟩ and the number of non-isolated vertices V×; while we approach their spectral properties with two measures on the graph adjacency matrix: the ratio of consecutive eigenvalue spacings r and the Shannon entropy S of eigenvectors. First we propose a heuristic expression for ⟨k(n,σ,ℓ)⟩. Then, we look for the scaling properties of the normalized average measure ⟨X¯¯¯¯⟩ (where X stands for V×, r and S) over graph ensembles. We demonstrate that the scaling parameter of ⟨Vׯ¯¯¯¯¯⟩=⟨V×⟩/n is indeed ⟨k⟩; with ⟨Vׯ¯¯¯¯¯⟩≈1−exp(−⟨k⟩). Meanwhile, the scaling parameter of both ⟨r¯¯⟩ and ⟨S¯¯¯⟩ is proportional to n−γ⟨k⟩ with γ≈0.16., J.A.M.-B. acknowledges financial support from CONACyT (Grant No. A1-S-22706) and BUAP (Grant No. 100405811-VIEP2021). E.E. thanks financial support from Ministerio de Ciencia, Innovacion y Universidades, Spain, for Grant No. PID2019-107603GB-I00, “Hubs-repelling/attracting Laplacian operators and related dynamics on graphs/networks.” F.A.R. acknowledges CNPq (Grant No. 309266/2019-0) and FAPESP (Grant No. 19/23293-0) for the financial support given for this research., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

Topologically-induced suppression of explosive synchronization

  • Miranda, Manuel
  • Frasca, Mattia
  • Estrada, Ernesto
Nowadays, explosive synchronization is a well documented phenomenon occurring in networks when the node frequency and its degree are correlated. This first-order transition, which may coexists with classical synchronization, has been recently causally linked to some pathological brain states like epilepsy and fibromyalgia. It is then intriguing how most of neuronal systems can operate in normal conditions avoiding explosive synchronization. Here, we have discovered that synchronization in networks where the oscillators are coupled via degree-biased Laplacian operators, naturally controls the transition from explosive to standard synchronization in neuronal-like systems. We prove analytically that explosive synchronization emerges when using this theoretical setting in star-like (neuronal) networks. As soon as this star-like network is topologically converted to a network containing cycles, e.g., via synaptic connections to other neurons, the explosive synchronization gives rise to classical synchronization. This allows us to hypothesize that such topological control of explosive synchronization could be a mechanism for the brain to naturally work in normal, non-pathological, conditions., M.M. thanks financial support PRE2020-092875 by MCIN/AEI /10.13039/501100011033 and by FSE invierte en tu futuro. E.E. thanks Grant PID2019-107603GB-I00 by MCIN/ AEI /10.13039/501100011033., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

Signed graphs in data sciences via communicability geometry

  • Díaz-Díaz, Fernando
  • Estrada, Ernesto
Signed graphs are an emergent way of representing data in a variety of contexts were conflicting interactions exist. These include data from biological, ecological, and social systems. Here we propose the concept of communicability geometry for signed graphs, proving that metrics in this space, such as the communicability distance and angles, are Euclidean and spherical. We then apply these metrics to solve several problems in data analysis of signed graphs in a unified way. They include the partitioning of signed graphs, dimensionality reduction, finding hierarchies of alliances in signed networks as well as the quantification of the degree of polarization between the existing factions in systems represented by this type of graphs., FDD and EE acknowledge funding from Ministerio de Ciencia e Innovacion, Agencia Estatal de Investigacion Program for Units of Excellences Maria de Maeztu (CEX2021−001164-M/10.13039/501100011033). FDD thanks financial support from MDM−2017 − 0711 − 20 − 2 funded by MCIN/AEI/10.13039/501100011033 and by FSE invierte en tu futuro, as well as project APASOS (No. PID2021−122256NB−C21). EE also acknowledges funding from project OLGRA (PID2019-107603GB-I00) funded by Spanish Ministry of Science and Innovation., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

Indirect social influence and diffusion of innovations: An experimental approach

  • Miranda, Manuel
  • Pereda, María
  • Sánchez, Angel
  • Estrada, Ernesto
A fundamental feature for understanding the diffusion of innovations through a social group is the manner in which we are influenced by our own social interactions. It is usually assumed that only direct interactions, those that form our social network, determine the dynamics of adopting innovations. Here, we put this assumption to the test by experimentally and theoretically studying the role of direct and indirect influences in the adoption of innovations. We perform experiments specifically designed to capture the influence that an individual receives from their direct social ties as well as from those socially close to them, as a function of the separation they have in their social network. The results of 21 experimental sessions with more than 590 participants show that the rate of adoption of an innovation is significantly influenced not only by our nearest neighbors but also by the second and third levels of influences an adopter has. Using a mathematical model that accounts for both direct and indirect interactions in a network, we fit the experimental results and determine the way in which influences decay with social distance. The results indicate that the strength of peer pressure on an adopter coming from its second and third circles of influence is approximately 2/3 and 1/3, respectively, relative to their closest neighbors. Our results strongly suggest that innovation adoption is a complex process in which an individual feels significant pressure not only from their direct ties but also by those socially close to them., A. S. acknowledge support from grant PID2022-141802NB-I00 (BASIC) funded by MCIN/AEI/10.13039/501100011033 and by ‘ERDF A way of making Europe’, and from grant MapCDPerNets—Programa Fundamentos de la Fundación BBVA 2022. M.M and E.E. acknowledge support from Project OLGRA (PID2019-107603GB-I00) funded by Spanish Ministry of Science and Innovation as well as by the Maria de Maeztu project CEX2021-001164-M funded by the MCIN/AEI/10.13039/501100011033., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

Mathematical Modeling of Local Balance in Signed Networks and Its Applications to Global International Analysis

  • Díaz-Díaz, Fernando
  • Bartesaghi, Paolo
  • Estrada, Ernesto
Alliances and conflicts in social, political and economic relations can be represented by positive and negative edges in signed networks. A cycle is said to be positive if the product of its edge signs is positive, otherwise it is negative. Then, a signed network is balanced if and only if all its cycles are positive. An index characterizing how much a signed network deviates from being balanced is known as a global balance index. Here we give a step forward in the characterization of signed networks by defining a local balance index, which characterizes how much a given vertex of a signed network contributes to its global balance. We analyze the mathematical foundations and unique structural properties of this index. Then, we apply this index to the study of the evolution of international relations in the globe for the period 1816-2014. In this way we detect and categorize major historic events based on balance fluctuations, helping our understanding towards new mixed approaches to history based on network theory., FDD and EE acknowledge funding from the Spanish Ministerio de Ciencia e Innovación, Agencia Estatal de Investigación Program for Units of Excellences María de Maeztu (CEX2021-001164-M /10.13039/501100011033). FDD thanks financial support MDM-2017-0711-20-2 funded by MCIN/AEI/10.13039/501100011033 and by FSE invierte en tu futuro, as well as project APASOS (No. PID2021-122256NB-C22). EE also acknowledges funding from project OLGRA (PID2019-107603GB-I00) funded by Spanish Ministry of Science and Innovation. Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., No