arXiv subjects

Ernesto Estrada

Publications and source records attributed to Ernesto Estrada.

At least 19 recordsLinked to original sources

arXiv2026

Fractional Diffusion on Graphs: Superposition of Laplacian Semigroups and Memory

Subdiffusion on graphs is often modeled by time-fractional diffusion equations, yet its structural and dynamical consequences remain unclear. We show that subdiffusive transport on graphs is a memory-driven process generated by a random time change that compresses operational time, produces long-tailed waiting times, and breaks Markovianity while preserving linearity and mass conservation. We prove that Mittag-Leffler graph dynamics admit an exact convex, mass-preserving representation as a superposition of classical heat semigroups evaluated at rescaled times, revealing fractional diffusion as ordinary diffusion acting across multiple intrinsic time scales. This framework uncovers heterogeneous, vertex-dependent memory effects and induces transport biases absent in classical diffusion, including algebraic relaxation, degree-dependent waiting times, and early-time asymmetries between sources and neighbors. These features define a subdiffusive geometry on graphs enabling particles to locally discover global shortest paths while favoring high-degree regions. Finally, we show that time-fractional diffusion arises as a singular limit of multi-rate diffusion.

cs.SI↗

arXiv2024

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

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.

physics.soc-ph↗

arXiv2024

Indirect social influence and diffusion of innovations: An experimental approach

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.

physics.soc-ph↗

arXiv2024

Balance with Memory in Signed Networks via Mittag-Leffler Matrix Functions

Structural balance is an important characteristic of graphs/networks where edges can be positive or negative, with direct impact on the study of real-world complex systems. When a network is not structurally balanced, it is important to know how much balance still exists in it. Although several measures have been proposed to characterize the degree of balance, the use of matrix functions of the signed adjacency matrix emerges as a very promising area of research. Here, we take a step forward to using Mittag-Leffler (ML) matrix functions to quantify the notion of balance of signed networks. We show that the ML balance index can be obtained from first principles on the basis of a nonconservative diffusion dynamic, and that it accounts for the memory of the system about the past, by diminishing the penalization that long cycles typically receive in other matrix functions. Finally, we demonstrate the important information in the ML balance index with both artificial signed networks and real-world networks in various contexts, ranging from biological and ecological to social ones.

cs.SI↗

arXiv2024

Signed graphs in data sciences via communicability geometry

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.

math.MG↗

arXiv2023

Network bypasses sustain complexity

Real-world networks are neither regular nor random, a fact elegantly explained by mechanisms such as the Watts-Strogatz or the Barabasi-Albert models, among others. Both mechanisms naturally create shortcuts and hubs, which while enhancing 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.

physics.soc-ph↗

arXiv2023

Topologically-induced suppression of explosive synchronization

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.

physics.soc-ph↗

arXiv2022

The world-wide waste web

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.

physics.soc-ph↗

arXiv2022

Time and space generalized diffusion equation on graphs/networks

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 d-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.

physics.soc-ph↗

arXiv2021

From networked SIS model to the Gompertz function

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.

math.AP↗

arXiv2021

Hubs-biased resistance distances on graphs and networks

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.

math.SP↗

arXiv2021

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

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 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.

physics.soc-ph↗

arXiv2021

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

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 $σ\in(0,\infty)$ and $ρ(θ)$ as an uniform distribution in the interval $θ\in [0,2π)$. Then, two vertices are connected by an edge if their Euclidian distance is less or equal than the connection radius $\ell$. We characterize the topological properties of this random graph model, which depends on the parameter set $(n,σ,\ell)$, by the use of the average degree $\left\langle k \right\rangle$ and the number of non-isolated vertices $V_\times$; 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 $\left\langle k(n,σ,\ell) \right\rangle$. Then, we look for the scaling properties of the normalized average measure $\left\langle \overline{X} \right\rangle$ (where $X$ stands for $V_\times$, $r$ and $S$) over graph ensembles. We demonstrate that the scaling parameter of $\left\langle \overline{V_\times} \right\rangle=\left\langle V_\times \right\rangle/n$ is indeed $\left\langle k \right\rangle$; with $\left\langle \overline{V_\times} \right\rangle \approx 1-\exp(-\left\langle k \right\rangle)$. Meanwhile, the scaling parameter of both $\left\langle \overline{r} \right\rangle$ and $\left\langle \overline{S} \right\rangle$ is proportional to $n^{-γ} \left\langle k \right\rangle$ with $γ\approx 0.16$.

cond-mat.dis-nn↗

arXiv2020

Random Multi-Hopper Model. Super-Fast Random Walks on Graphs

We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the two nodes. We consider here two decaying functions in the form of the Laplace and Mellin transforms of the shortest-path distances. Remarkably, when the parameters of these transforms approach zero asymptotically, the multi-hopper's hitting times between any two nodes in the graph converge to their minimum possible value, given by the hitting times of a normal random walker on a complete graph. Stated differently, for small parameter values the multi-hopper explores a general graph as fast as possible when compared to a random walker on a full graph. Using computational experiments we show that compared to the normal random walker, the multi-hopper indeed explores graphs with clusters or skewed degree distributions more efficiently for a large parameter range. We provide further computational evidence of the speed-up attained by the random multi-hopper model with respect to the normal random walker by studying deterministic, random and real-world networks.

physics.soc-ph↗

arXiv2020

Fractional-order susceptible-infected model: definition and applications to the study of COVID-19 main protease

We propose a model for the transmission of perturbations across the amino acids of a protein represented as an interaction network. The dynamics consists of a Susceptible-Infected (SI) model based on the Caputo fractional-order derivative. We find an upper bound to the analytical solution of this model which represents the worse-case scenario on the propagation of perturbations across a protein residue network. This upper bound is expressed in terms of Mittag-Leffler functions of the adjacency matrix of the network of inter-amino acids interactions. We then apply this model to the analysis of the propagation of perturbations produced by inhibitors of the main protease of SARS CoV-2. We find that the perturbations produced by strong inhibitors of the protease are propagated far away from the binding site, confirming the long-range nature of intra-protein communication. On the contrary, the weakest inhibitors only transmit their perturbations across a close environment around the binding site. These findings may help to the design of drug candidates against this new coronavirus.

q-bio.MN↗

arXiv2020

Risk-dependent centrality in economic and financial networks

Node centrality is one of the most important and widely used concepts in the study of complex networks. Here, we extend the paradigm of node centrality in financial and economic networks to consider the changes of node "importance" produced not only by the variation of the topology of the system but also as a consequence of the external levels of risk to which the network as a whole is submitted. Starting from the "Susceptible-Infected" (SI) model of epidemics and its relation to the communicability functions of networks we develop a series of risk-dependent centralities for nodes in (financial and economic) networks. We analyze here some of the most important mathematical properties of these risk-dependent centrality measures. In particular, we study the newly observed phenomenon of ranking interlacement, by means of which two entities may interlace their ranking positions in terms of risk in the network as a consequence of the change in the external conditions only, i.e., without any change in the topology. We test the risk-dependent centralities by studying two real-world systems: the network generated by collecting assets of the S\&P 100 and the corporate board network of the US top companies, according to Forbes in 1999. We found that a high position in the ranking of the analyzed financial companies according to their risk-dependent centrality corresponds to companies more sensitive to the external market variations during the periods of crisis.

q-fin.MF↗

arXiv2019

Metaplex networks: influence of the exo-endo structure of complex systems on diffusion

In a complex system the interplay between the internal structure of its entities and their interconnection may play a fundamental role in the global functioning of the system. Here, we define the concept of metaplex, which describes such trade-off between internal structure of entities and their interconnections. We then define a dynamical system on a metaplex and study diffusive processes on them. We provide analytical and computational evidences about the role played by the size of the nodes, the location of the internal coupling areas, and the strength and range of the coupling between the nodes on the global dynamics of metaplexes. Finally, we extend our analysis to two real-world metaplexes: a landscape and a brain metaplex. We corroborate that the internal structure of the nodes in a metaplex may dominate the global dynamics (brain metaplex) or play a regulatory role (landscape metaplex) to the influence of the interconnection between nodes.

physics.soc-ph↗

arXiv2019

Indetermination of networks structure from the dynamics perspective

Networks are universally considered as complex structures of interactions of large multi-component systems. In order to determine the role that each node has inside a complex network, several centrality measures have been developed. Such topological features are also important for their role in the dynamical processes occurring in networked systems. In this paper, we argue that the dynamical activity of the nodes may strongly reshape their relevance inside the network making centrality measures in many cases misleading. We show that when the dynamics taking place at the local level of the node is slower than the global one between the nodes, then the system may lose track of the structural features. On the contrary, when that ratio is reversed only global properties such as the shortest distances can be recovered. From the perspective of networks inference, this constitutes an uncertainty principle, in the sense that it limits the extraction of multi-resolution information about the structure, particularly in the presence of noise. For illustration purposes, we show that for networks with different time-scale structures such as strong modularity, the existence of fast global dynamics can imply that precise inference of the community structure is impossible.

physics.soc-ph↗