Pasar al contenido principal

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

PID2019-107603GB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2019
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE ZARAGOZA

Resultados relacionados

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

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Cascading from SARS-CoV-2 to Parkinson’s Disease through Protein-Protein Interactions

  • Estrada, Ernesto
Extensive extrapulmonary damages in a dozen of organs/systems, including the central nervous system (CNS), are reported in patients of the coronavirus disease 2019 (COVID-19). Three cases of Parkinson’s disease (PD) have been reported as a direct consequence of COVID-19. In spite of the scarce data for establishing a definitive link between COVID-19 and PD, some hypotheses have been proposed to explain the cases reported. They, however, do not fit well with the clinical findings reported for COVID-19 patients, in general, and for the PD cases reported, in particular. Given the importance of this potential connection, we present here a molecular-level mechanistic hypothesis that explains well these findings and will serve to explore the potential CNS damage in COVID-19 patients. The model explaining the cascade effects from COVID-19 to CNS is developed by using bioinformatic tools. It includes the post-translational modification of host proteins in the lungs by viral proteins, the transport of modified host proteins via exosomes out the lungs, and the disruption of protein-protein interaction in the CNS by these modified host proteins. Our hypothesis is supported by finding 44 proteins significantly expressed in the CNS which are associated with PD and whose interactions can be perturbed by 24 host proteins significantly expressed in the lungs. These 24 perturbators are found to interact with viral proteins and to form part of the cargoes of exosomes in human tissues. The joint set of perturbators and PD-vulnerable proteins form a tightly connected network with significantly more connections than expected by selecting a random cluster of proteins of similar size from the human proteome. The molecular-level mechanistic hypothesis presented here provides several routes for the cascading of effects from the lungs of COVID-19 patients to PD. In particular, the disruption of autophagy/ubiquitination processes appears as an important mechanism that triggers the generation of large amounts of exosomes containing perturbators in their cargo, which would insult several PD-vulnerable proteins, potentially triggering Parkinsonism in COVID-19 patients, This study was partially funded by Ministerio de Ciencia, Innovacion y Universidades, Spain, Grant PID2019-107603GB-I00 “Hubs-repelling/attracting Laplacian operators and related dynamics on graphs/networks”., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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
Publicación 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
Publicación 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
Publicación Artículo científico (JournalArticle)

Informational cost and networks navigability

  • Estrada, Ernesto
Understanding how information navigates through nodes of a complex network has become an increasingly pressing problem across scientific disciplines. Several approaches have been proposed on the basis of shortest paths or diffusive navigation. However, no existing approaches have tackled the challenges of efficient communication in networks without full knowledge of their global topology under external noise. Here, we develop a first principles approach and mathematical formalism to determine the informational cost of navigating a network under different levels of external noise. Using this approach we discover the existence of a trade-off between the ways in which networks route information through shortest paths, their entropies and stability, which define three classes of real-world networks. This approach reveals that environmental pressure has shaped the ways in which information is transferred in bacterial metabolic networks and allowed us to determine the levels of noise at which a protein–protein interaction network seems to work in normal conditions in a cell., 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”., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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 stock 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 Ministerio de Ciencia, Innovacion y Universidades, Spain, Grant PID2019-107603GB-I00., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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
Publicación 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). E.E. thanks financial support from Ministerio de Ciencia, Innovación y Universidades, Spain for the grant PID2019-107603GB-I00 “Hubs-repelling/attracting Laplacian operators and related dynamics on graphs/networks”. This article is based upon work from COST Action 18232 MAT-DYN-NET, supported by COST (European Cooperation in Science and Technology), http://www.cost.eu., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Path Laplacians versus fractional Laplacians as nonlocal operators on networks

  • Estrada, Ernesto
Here we study and compare nonlocal diffusion processes on networks based on two different kinds of Laplacian operators. We prove that a nonlocal diffusion process on a network based on the path Laplacian operator always converges faster than the standard diffusion. The nonlocal diffusion based on the fractional powers of the graph Laplacian frequently converges slower than the local process. Additionally, the path-based diffusion always displays smaller average commute time and better diffusive efficiency than the local diffusive process. On the contrary, the fractional diffusion frequently has longer commute times and worse diffusive efficiency than the standard diffusion process. Another difference between the two processes is related to the way in which they operate the diffusion through the nodes and edges of the graph. The fractional diffusion occurs in a backtracking way, which may left the diffusive particle trapped just behind obstacles in the nodes of the graph, such as a weighted self-loop. The path-diffusion operates in a non-backtracking way, which may represent through-space jumps that avoids such obstacles. We show that the fractional Laplacian cannot differentiate between three classes of brain cellular tissues corresponding to healthy, inflamed and glioma samples. The path Laplacian diffusive distance correctly classifies 100% of the mentioned samples. These results illuminates about the potential areas of applications of both kinds of nonlocal operators on networks., 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'.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

The world-wide waste web

  • Martínez, Johann H.
  • Romero, Sergi
  • Ramasco, José J.
  • Estrada, Ernesto
Countries globally trade with tons of waste materials every year, some of which are highly hazardous. This trade admits a network representation of the world-wide waste web, with countries as vertices and flows as directed weighted edges. Here we investigate the main properties of this network by tracking 108 categories of wastes interchanged in the period 2001–2019. Although, most of the hazardous waste was traded between developed nations, a disproportionate asymmetry existed in the flow from developed to developing countries. Using a dynamical model, we simulate how waste stress propagates through the network and affects the countries. We identify 28 countries with low Environmental Performance Index that are at high risk of waste congestion. Therefore, they are at threat of improper handling and disposal of hazardous waste. We find evidence of pollution by heavy metals, by volatile organic compounds and/or by persistent organic pollutants, which are used as chemical fingerprints, due to the improper handling of waste in several of these countries., Partial funding has been received from the Maria de Maeztu program for Units of Excellence MDM-2017-0711 (J.H.M., S.R., J.J.R., and E.E.), from the grant PID2019-107603GB-I00 (E.E.) and PACSS RTI2018-093732-B-C22 (J.H.M. and J.J.R.), all of the MCIN/AEI/10.13039/501100011033/ of EU through FEDER funds (A way to make Europe), and also from the Colciencias Call (#811) (J.H.M.) of the Colombian Ministry of Science, Technology, and Innovation., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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
We consider 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. We find an approximate solution to the Susceptible-Infected-Susceptible (SIS) model, which constitutes an 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 UK airport transportation network weighted by the number of passengers transported in 2003. We find that the removal of all flights connecting four origin-destination pairs in the UK 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 epidemic, 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”.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Generalized diffusion equation on graphs/networks

  • Díaz-Díaz, Fernando
  • Estrada, Ernesto
Trabajo presentado en el IFISC Poster Party (online).-- The IFISC Poster Party is an annual activity where PhD students and postdoctoral researchers of IFISC present their research in a poster format.-- Complex Systems: Statistical and Nonlinear Physics., FD-D and EE acknowledge support from the Spanish Agency of Research (AEI) through Maria de Maeztu Program for units of Excellence in R&D (MDM-2017-0711). FD-D thanks financial support MDM-2017-0711-20-2 funded by MCIN/AEI/10.13039/50110 0 011033 and by FSE invierte en tu futuro. EE thanks Grant PID2019-107603GB-I00 by MCIN/AEI /10.13039/50110 0 011033., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Degree-Biased Advection-Diffusion on undirected graphs/networks

  • Miranda, Manuel
  • Estrada, Ernesto
There are several phenomena in nature governed by simultaneous or intermittent diffusion and advection processes. Many of these systems are networked by their own nature. Here we propose a degree-biased advection processes to undirected networks. For that purpose we define and study the degree-biased advection operator. We then develop a degree-biased advection-diffusion equation on networks and study its general properties. We give computational evidence of the utility of this new model by studying random graphs as well as a real-life patched landscape network in southern Madagascar. In the last case we show that the foraging movement of the species L. catta in this environment occurs mainly in a diffusive way with important contributions of advective motions in agreement with previous empirical observations., 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
Publicación 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
Publicación 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., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Nonuniform random graphs on the plane: A scaling study

  • Martínez Martínez, C. T.
  • Méndez-Bermúdez, J. A.
  • Rodrigues, Francisco A.
  • Estrada, Ernesto
We consider random geometric graphs on the plane characterized by a nonuniform density of vertices. In particular, we introduce a graph model where n vertices are independently distributed in the unit disk 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 a uniform distribution in the interval θ∈[0,2π). Then, two vertices are connected by an edge if their Euclidean distance is less than or equal to 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 nonisolated 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., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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
Publicación Artículo científico (JournalArticle)

Time and space generalized diffusion equation on graph/networks

  • Díaz-Díaz, Fernando
  • Estrada, Ernesto
Normal and anomalous diffusion are ubiquitous in many complex systems [1]. Here, we define a time and space generalized diffusion equation (GDE), which uses fractional-time derivatives and transformed -path Laplacian operators on graphs/networks. We find analytically the solution of this equation and prove that it covers the regimes of normal, sub- and superdiffusion as a function of the two parameters of the model. We extend the GDE to consider a system with temporal alternancy of normal and anomalous diffusion which can be observed for instance in the diffusion of proteins along a DNA chain. We perform computational experiments on a one-dimensional system emulating a linear DNA chain. It is shown that a subdiffusive-superdiffusive alternant regime allows the diffusive particle to explore more slowly small regions of the chain with a faster global exploration, than a subdiffusive-subdiffusive regime. Therefore, an alternancy of sliding (subdiffusive) with hopping and intersegmental transfer (superdiffusive) mechanisms show important advances for protein-DNA interactions., FD-D and EE acknowledge support from the Spanish Agency of Research (AEI) through Maria de Maeztu Program for units of Excellence in R&D (MDM-2017-0711). FD-D thanks finantial support MDM-2017-0711-20-2 funded by MCIN/AEI/10.13039/501100011033 and by FSE invierte en tu futuro. EE thanks Grant PID2019-107603GB-I00 by MCIN/AEI /10.13039/501100011033.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Communicability in time-varying networks with memory

  • Estrada, Ernesto
We develop a first-principles approach to define the communicability between two nodes in a time-varying network with memory. The formulation is based on the time-fractional Schrödinger equation, where the fractional (of Caputo type) derivative accounts for the memory of the system. Using a time-varying Hamiltonian in the tight-binding formalism we propose the temporal communicability as the product of Mittag-Leffer functions of the adjacency matrices of the temporal snapshots. We then show that the resolvent- and exponential-communicabilities of a network are special cases of the proposed temporal communicability when perfect (resolvent) or imperfect (exponential) memory are considered for the system. By using theoretical and empirical evidence we show that real-world systems work out of perfect memory, and with an interrelation between memory-dependent temporal communication and imperfect memory spatial transmission of information. We illustrate our results with the study of trophallaxis interactions in two ant colonies., The author thanks financial support from the Grant PID2019-107603GB-I00 of the MCIN/AEI/10.13039/501100011033/., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Statistical–mechanical theory of topological indices

  • Estrada, Ernesto
Topological indices (TI) are algebraic invariants of molecular graphs representing the topology of a molecule, which are very valuable in quantitative structure–property relations (QSPR). Here we prove that TI are the partition functions of such molecules when the temperature of the thermal bath at which they are submerged is very high. These partition functions are obtained by describing molecular electronic properties through tight-binding Hamiltonians (TBH), where the hopping parameters are topological properties describing atom–atom interactions. We prove that the TBH proposed here are non-Hermitian diagonalizable Hamiltonians which can be replaced by symmetric ones. In this way we propose a statistical–mechanical theory for TI, which is exemplified by deriving the Randić, Zagreb, Balaban, Wiener and ABC indices. The work also illuminates how to improve QSPR models using the current theoretical framework as well as how to derive statistical–mechanical parameters of molecular graphs., The author thanks financial support from the grant PID2019-107603GB-I00 of the MCIN/AEI /10.13039/501100011033/ ., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix

  • Estrada, Ernesto
The communicability distance (Estrada (2012) [5]) is a useful metric to characterize alternative navigational routes in graphs. Here we prove that it is the resistance distance between a pair of nodes in a weighted graph. We extend this result and prove that every nonsingular Euclidean distance matrix is the resistance distance matrix of a weighted graph. We briefly analyze some mathematical properties of the communicability Laplacian matrix which emerges from the current analysis., The author thanks anonymous referee for important corrections on the original version. Financial support by the grant PID2019-107603GB-I00 of the MCIN/AEI/0.13039/501100011033/ is also acknowledged., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Fractional-Modified Bessel Function of the First Kind of Integer Order

  • Martín, Andrés
  • Estrada, Ernesto
The modified Bessel function (MBF) of the first kind is a fundamental special function in mathematics with applications in a large number of areas. When the order of this function is integer, it has an integral representation which includes the exponential of the cosine function. Here, we generalize this MBF to include a fractional parameter, such that the exponential in the previously mentioned integral is replaced by a Mittag–Leffler function. The necessity for this generalization arises from a problem of communication in networks. We find the power series representation of the fractional MBF of the first kind as well as some differential properties. We give some examples of its utility in graph/networks analysis and mention some fundamental open problems for further investigation., Project OLGRA (PID2019-107603GB-I00) funded by the Spanish Ministry of Science and Innovation as well as 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)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Topologically induced suppression of explosive synchronization

  • Miranda, Manuel
  • Frasca, Mattia
  • Estrada, Ernesto
13 pages, 11 figures., Nowadays, explosive synchronization is a well-documented phenomenon consisting in a first-order transition that may coexist with classical synchronization. Typically, explosive synchronization occurs when the network structure is represented by the classical graph Laplacian, and the node frequency and its degree are correlated. Here, we answer the question on whether this phenomenon can be observed in networks when the oscillators are coupled via degree-biased Laplacian operators. We not only observe that this is the case but also that this new representation naturally controls the transition from explosive to standard synchronization in a network. We prove analytically that explosive synchronization emerges when using this theoretical setting in star-like networks. As soon as this star-like network is topologically converted into a network containing cycles, the explosive synchronization gives rise to classical synchronization. Finally, we hypothesize that this mechanism may play a role in switching from normal to explosive states in the brain, where explosive synchronization has been proposed to be related to some pathologies like epilepsy and fibromyalgia., M.M. acknowledges financial support (No. PRE2020-092875) by MCIN/AEI /10.13039/501100011033 and by FSE invierte en tu futuro. E.E. acknowledges Grant No. PID2019-107603GB-I00 by MCIN/ AEI /10.13039/501100011033. M.M. and E.E. 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 (No. CEX2021-001164-M /10.13039/501100011033)., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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
Publicación Artículo científico (JournalArticle)

What Is in a Simplicial Complex? A Metaplex-Based Approach to Its Structure and Dynamics

  • Miranda, Manuel
  • Estrada-Rodriguez, Gissell
  • Estrada, Ernesto
Geometric realization of simplicial complexes makes them a unique representation of complex systems. The existence of local continuous spaces at the simplices level with global discrete connectivity between simplices makes the analysis of dynamical systems on simplicial complexes a challenging problem. In this work, we provide some examples of complex systems in which this representation would be a more appropriate model of real-world phenomena. Here, we generalize the concept of metaplexes to embrace that of geometric simplicial complexes, which also includes the definition of dynamical systems on them. A metaplex is formed by regions of a continuous space of any dimension interconnected by sinks and sources that works controlled by discrete (graph) operators. The definition of simplicial metaplexes given here allows the description of the diffusion dynamics of this system in a way that solves the existing problems with previous models. We make a detailed analysis of the generalities and possible extensions of this model beyond simplicial complexes, e.g., from polytopal and cell complexes to manifold complexes, and apply it to a real-world simplicial complex representing the visual cortex of a macaque., M.M. and E.E. acknowledge support from Project OLGRA (PID2019-107603GB-I00) funded by the 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. G.E.-R acknowledges support from the project macroKNIGHTs (PID2022-143012NA-100) funded by the Spanish Ministry of Science and Innovation., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Communicability cosine distance: similarity and symmetry in graphs/networks

  • Estrada, Ernesto
A distance based on the exponential kernel of the adjacency matrix of a graph and representing how well two vertices connect to each other in a graph is defined and studied. This communicability cosine distance (CCD) is a Euclidean spherical distance accounting for the cosine of the angles spanned by the position vectors of the graph vertices in this space. The Euclidean distance matrix (EDM) of CCD is used to quantify the similarity between vertices in graphs and networks as well as to define a local vertex invariant—a closeness centrality measure, which discriminate very well vertices in small graphs. It allows to distinguish all nonidentical vertices, also characterizing all identity (asymmetric) graphs–those having only the identity automorphism–among all connected graphs of up to 9 vertices. It also characterizes several other classes of identity graphs. We also study real-world networks in term of both the discriminating power of the new centrality on their vertices as well as in ranking their vertices. We analyze some dictionary networks as well as the network of copurshasing of political books, remarking some of the main advantages of the new approaches studied here., The author thanks financial 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. 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)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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
Publicación Artículo científico (JournalArticle)

What is a Complex System, After All?

  • Estrada, Ernesto
The study of complex systems, although an interdisciplinary endeavor, is considered as an integrating part of physical sciences. Contrary to the historical fact that the field is already mature, it still lacks a clear and unambiguous definition of its main object of study. Here, I propose a definition of complex systems based on the conceptual clarifications made by Edgar Morin about the bidirectional non-separability of parts and whole produced by the nature of interactions. Then, a complex system is defined as the system where there is a bidirectional non-separability between the identities of the parts and the identity of the whole. Thus, not only the identity of the whole is determined by the constituent parts, but also the identity of the parts are determined by the whole due to the nature of their interactions. This concept allows, as shown in the paper, to derive some of the main properties that such systems must have as well as to propose its mathematical formalization., The author acknowledges funding from project OLGRA (PID2019-107603GB-I00) funded by Spanish Ministry of Science and Innovation as well as the Maria de Maeztu project CEX2021-001164-M funded by the MCIN/AEI/10.13039/501100011033. 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)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Emergence of cooperation in the one-shot Prisoner's dilemma through Discriminatory and Samaritan AIs

  • Zimmaro, Filippo
  • Miranda, Manuel
  • Ramos Fernández, José María
  • Moreno López, Jesús A.
  • Reddel, Max
  • Widler, Valeria
  • Antonioni, Alberto
  • Han, The Anh
As artificial intelligence (AI) systems are increasingly embedded in our lives, their presence leads to interactions that shape our behaviour, decision-making and social interactions. Existing theoretical research on the emergence and stability of cooperation, particularly in the context of social dilemmas, has primarily focused on human-to-human interactions, overlooking the unique dynamics triggered by the presence of AI. Resorting to methods from evolutionary game theory, we study how different forms of AI can influence cooperation in a population of human-like agents playing the one-shot Prisoner's dilemma game. We found that Samaritan AI agents who help everyone unconditionally, including defectors, can promote higher levels of cooperation in humans than Discriminatory AI that only helps those considered worthy/cooperative, especially in slow-moving societies where change based on payoff difference is moderate (small intensities of selection). Only in fast-moving societies (high intensities of selection), Discriminatory AIs promote higher levels of cooperation than Samaritan AIs. Furthermore, when it is possible to identify whether a co-player is a human or an AI, we found that cooperation is enhanced when human-like agents disregard AI performance. Our findings provide novel insights into the design and implementation of context-dependent AI systems for addressing social dilemmas., T.A.H. is supported by EPSRC (grant EP/Y00857X/1) and the Future of Life Institute. J.A.M.L.’s salary was funded by the Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/ 10.13039/501100011033 under grant FPI PRE2019-089734. Partial financial support for J.A.M.L. and M.M. has been received from the Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/ 10.13039/501100011033 and Fondo Europeo de Desarrollo Regional (FEDER, UE) under Project APASOS (PID2021-122256NB-C21/C22) and the María de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M). M.M. and A.A. acknowledge support from Project OLGRA (PID2019-107603GB-I00) and grant no. IJC2019-040967-I 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)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

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 test this assumption 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 two-third and one-third, respectively, relative to their closest neighbors. Our results strongly suggest that the adoption of an innovation 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)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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
Publicación 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
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

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)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

What is a mathematician doing…in a chemistry class?

  • Estrada, Ernesto
The way of thinking of mathematicians and chemists in their respective disciplines seems to have very different levels of abstractions. While the firsts are involved in the most abstract of all sciences, the seconds are engaged in a practical, mainly experimental discipline. Therefore, it is surprising that many luminaries of the mathematics universe have studied chemistry as their main subject. Others have started studying chemistry before swapping to mathematics or have declared some admiration and even love for this discipline. Here I reveal some of these mathematicians who were involved in chemistry from a biographical perspective. Then, I analyze what these remarkable mathematicians and statisticians could have learned while studying chemical subjects. I found analogies between code-breaking and molecular structure elucidation, inspiration for statistics in quantitative analytical chemistry, and on the role of topology in the study of some organic molecules. I also analyze some parallelisms between the way of thinking of organic chemists and mathematicians in terms of the use of backward analysis, search for patterns, and use of pictures in their respective researches., Also Spanish Ministry of Science and Innovation for funding project OLGRA (PID2019-107603GB-I00) as well as the Maria de Maeztu project CEX2021-001164-M funded by the MCIN/AEI/10.13039/501100011033., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Conservative Versus Non-conservative Diffusion Toward a Target in a Networked Environment

  • Estrada, Ernesto
Grebenkov, D., Metzler, R., Oshanin, G. (eds)., The networked nature of complex systems determines the way in which “information” navigates the system from a source to a target. This navigation is gov-erned by the lack of central controllers and the fact that every individual entity ignores the global structure of the system. Consequently, targeted shortest-path searches are almost automatically excluded in these systems, leaving the more blind diffusive pro-cesses as the main mechanism for navigating complex networks. Here we show that non-conservative diffusion has some advantages over the “classical” (conservative) diffusion for searching a target in a network. The non-conservative nature of the dif-fusion process is given by the possibility that the network “communicates” with the environment in which it is embedded. We use analytical and computational methods to show that non-conservative diffusion uses trajectories which are more prone to find a target than the conservative one. We illustrate the existence of this mechanisms in systems as varied as traffic in urban environments, volume transmission in the brain, and communication through online social networks., The author thanks Project OLGRA (PID2019-107603GB-I00) funded by Spanish Ministry of Science and Innovation and the Maria de Maeztu project CEX2021-001164-M funded by the MCIN/AEI/10.13039/501100011033., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Signed graphs in data sciences via communicability geometry, Information Sciences

  • Díaz-Díaz, Fernando
  • Estrada, Ernesto
Signed graphs are an emergent way of representing data in a variety of contexts where antagonistic interactions exist. These include data from biological, ecological, and social systems. Here we propose the concept of communicability for signed graphs and explore in depth its mathematical properties. We also prove that the communicability induces a hyperspherical geometric embedding of the signed network, and derive communicability-based metrics that satisfy the axioms of a distance even in the presence of negative edges. We then apply these metrics to solve several problems in the data analysis of signed graphs within a unified framework. These include the partitioning of signed graphs, dimensionality reduction, finding hierarchies of alliances in signed networks, and quantifying the degree of polarization between the existing factions in social systems represented by these types of graphs., EE thanks Zeev Maoz for sharing data. FDD and EE acknowledge funding from Ministerio de Ciencia e Innovacion, Agencia Estatal de Investigación 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-C22). 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 "María de Maeztu Unit of Excellence" accreditation (CEX2021-001164-M), Peer reviewed
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Loss of structural balance in stock markets

  • Ferreira, E.
  • Orbe, S.
  • Ascorbebeitia, J.
  • Álvarez Pereira, B.
  • Estrada, E.
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 stock predictability, a finding with novel important implications for asset allocation and portfolio hedging strategies. © 2021, The Author(s).
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

The world-wide waste web

  • Martínez, J.H.
  • Romero, S.
  • Ramasco, J.J.
  • Estrada, E.
Countries globally trade with tons of waste materials every year, some of which are highly hazardous. This trade admits a network representation of the world-wide waste web, with countries as vertices and flows as directed weighted edges. Here we investigate the main properties of this network by tracking 108 categories of wastes interchanged in the period 2001–2019. Although, most of the hazardous waste was traded between developed nations, a disproportionate asymmetry existed in the flow from developed to developing countries. Using a dynamical model, we simulate how waste stress propagates through the network and affects the countries. We identify 28 countries with low Environmental Performance Index that are at high risk of waste congestion. Therefore, they are at threat of improper handling and disposal of hazardous waste. We find evidence of pollution by heavy metals, by volatile organic compounds and/or by persistent organic pollutants, which are used as chemical fingerprints, due to the improper handling of waste in several of these countries.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Cascading from sars-cov-2 to parkinson’s disease through protein-protein interactions

  • Estrada E.
Extensive extrapulmonary damages in a dozen of organs/systems, including the central nervous system (CNS), are reported in patients of the coronavirus disease 2019 (COVID-19). Three cases of Parkinson’s disease (PD) have been reported as a direct consequence of COVID-19. In spite of the scarce data for establishing a definitive link between COVID-19 and PD, some hypotheses have been proposed to explain the cases reported. They, however, do not fit well with the clinical findings reported for COVID-19 patients, in general, and for the PD cases reported, in particular. Given the importance of this potential connection, we present here a molecular-level mechanistic hypothesis that explains well these findings and will serve to explore the potential CNS damage in COVID-19 patients. The model explaining the cascade effects from COVID-19 to CNS is developed by using bioinformatic tools. It includes the post-translational modification of host proteins in the lungs by viral proteins, the transport of modified host proteins via exosomes out the lungs, and the disruption of protein-protein interaction in the CNS by these modified host proteins. Our hypothesis is supported by finding 44 proteins significantly expressed in the CNS which are associated with PD and whose interactions can be perturbed by 24 host proteins significantly expressed in the lungs. These 24 perturbators are found to interact with viral proteins and to form part of the cargoes of exosomes in human tissues. The joint set of perturbators and PD-vulnerable proteins form a tightly connected network with significantly more connections than expected by selecting a random cluster of proteins of similar size from the human proteome. The molecular-level mechanistic hypothesis presented here provides several routes for the cascading of effects from the lungs of COVID-19 patients to PD. In particular, the disruption of autophagy/ubiquitination processes appears as an important mechanism that triggers the generation of large amounts of exosomes containing perturbators in their cargo, which would insult several PD-vulnerable proteins, potentially triggering Parkinsonism in COVID-19 patients. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Fractional-modified Bessel Function of the first kind of integer order

  • Martín, Andrés
  • Estrada, Ernesto
The modified Bessel function (MBF) of the first kind is a fundamental special function in mathematics with applications in a large number of areas. When the order of this function is integer, it has an integral representation which includes the exponential of the cosine function. Here, we generalize this MBF to include a fractional parameter, such that the exponential in the previously mentioned integral is replaced by a Mittag–Leffler function. The necessity for this generalization arises from a problem of communication in networks. We find the power series representation of the fractional MBF of the first kind as well as some differential properties. We give some examples of its utility in graph/networks analysis and mention some fundamental open problems for further investigation.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Network bypasses sustain complexity

  • Estrada, Ernesto
  • Gómez-Gardeñes, Jesús
  • Lacasa, Lucas
Real-world networks are neither regular nor random, a fact elegantly explained by mechanisms such as the Watts–Strogatz or the Barabási-Albert models, among others. Both mechanisms naturally create shortcuts and hubs, which while enhancing the network’s connectivity, also might yield several undesired navigational effects: They tend to be overused during geodesic navigational processes—making the networks fragile—and provide suboptimal routes for diffusive-like navigation. Why, then, networks with complex topologies are ubiquitous? Here, we unveil that these models also entropically generate network bypasses: alternative routes to shortest paths which are topologically longer but easier to navigate. We develop a mathematical theory that elucidates the emergence and consolidation of network bypasses and measure their navigability gain. We apply our theory to a wide range of real-world networks and find that they sustain complexity by different amounts of network bypasses. At the top of this complexity ranking we found the human brain, which points out the importance of these results to understand the plasticity of complex systems.