Pasar al contenido principal

DIFUSION NO-CONSERVATIVA CON NOLOCALIDAD ESPACIO-TEMPORAL EN GRAFOS

PID2023-149473NB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2023
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

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

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

The Resistance Distance Is a Diffusion Distance on a Graph

  • Estrada, Ernesto
This article belongs to the Special Issue Advances in Combinatorics, Discrete Mathematics and Graph Theory, The resistance distance is a squared Euclidean metric on the vertices of a graph derived from the consideration of a graph as an electrical circuit. Its connection with the commute time of a random walker on the graph has made it particularly appealing for the analysis of networks. Here, we prove that the resistance distance is given by a difference of “mass concentrations” obtained at the vertices of a graph by a diffusive process. The nature of this diffusive process is characterized here by means of an operator corresponding to the matrix logarithm of a Perron-like matrix based on the pseudoinverse of the graph Laplacian. We prove also that this operator is indeed the Laplacian matrix of a signed version of the original graph, in which nonnearest neighbors’ “interactions” are also considered. In this way, the resistance distance is part of a family of squared Euclidean distances emerging from diffusive dynamics on graphs., The author is grateful for the financial support from Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/10.13039/501100011033 under grant PID2023-149473NB-I00 and by Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/10.13039/501100011033 and Fondo Europeo de Desarrollo Regional (FEDER, UE) under the María de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M)., With funding from the Spanish government through the "María de Maeztu Unit of Excellence" accreditation (CEX2021-001164-M), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

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

  • Tianand, Yu
  • Estrada, Ernesto
Structural balance is an important characteristic of graphs where edges can be positive or negative, or signed graphs, with a direct impact on the study of real-world complex systems. When a graph is not structurally balanced, it is important to know how much balance still exists. Although several measures have been proposed to characterize the degree of balance, the use of matrix functions of the signed adjacency matrix emerges as an up-and-coming area of research. Here, we take a step forward to use Mittag-Leffler (ML) matrix functions to quantify the notion of balance of signed graphs. We show that the ML balance index can be derived 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., The second author acknowledges support from the Maria de Maeztu project CEX2021-001164-M funded by the MCIN/AEI/10.13039/501100011033 and from Agencia Estatal de Investigaci´on (AEI, MCI, Spain) MCIN/AEI/ 10.13039/501100011033 under grant PID2023-149473NB-I00. The first author is funded by the Wallenberg Initiative on Networks and Quantum Information (WINQ)., 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 Artículo científico (JournalArticle)

What is a proper graph Laplacian? An operator-theoretic framework for graph diffusion

  • Estrada, Ernesto
We introduce an operator-theoretic definition of a proper graph Laplacian as any matrix associated with a given graph that can be expressed as the composition of a divergence and a gradient operator, with the gradient acting between graph-related spaces and annihilating constant functions. This provides a unified framework for determining whether a matrix represents a genuine diffusive operator on a graph. Within this framework, we prove that the standard Laplacian, the fractional Laplacian, the d-path Laplacians, and the degree-attracting and degree-repelling Laplacians are all proper diffusive Laplacians. In contrast, the in-degree and out-degree Laplacians correspond to advection operators, while the signed, signless, magnetic, and deformed Laplacians are improper, as they cannot be written as the composition of a divergence and a true gradient. The magnetic Laplacian is shown to arise as the Schur complement of an extended proper Laplacian defined on a higher-dimensional space, a property also inherited by the signless Laplacian. The Lerman-Ghosh Laplacian is identified as a nonconservative diffusive operator coupled to an external reservoir. Finally, we prove that the Moore-Penrose pseudoinverse of the Laplacian is itself a proper Laplacian. This classification establishes a rigorous operator-theoretic foundation for distinguishing proper, nonconservative, and improper graph Laplacians., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., Financial support from Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/ 10.13039/501100011033 under grant PID2023-149473NB-I00 and by Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/10.13039/501100011033 and Fondo Europeo de Desarrollo Regional (FEDER, UE) under the María de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M) are also acknowledged., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Geometries of mixed graphs in complex vector spaces. Hierarchies and clusters in complex networks

  • Estrada, Ernesto
We introduce several geometric measures for mixed graphs represented by complex-valued Hermitian adjacency matrices.We define the communicability functions based on the exponential of the Hermitian adjacency matrix and define complex-valued position vectors. Then, we define a Euclidean distance as well as complex, and Euclidean angles between these positions vectors for mixed graphs. Further we introduce Kähler and Hermitian angles between different planes among position vectors and holomorphic and projection planes, respectively. We find several mathematical relations and inequalities between all these geometric parameters. To illustrate the usability of some of these indices in the study of real-world networks we study the Kähler angle for finding hierarchies and detecting hierarchical clusters of vertices in ecological food webs, networks of co-purchasing of political books, a neuronal network, an Internet trolls network, and a software collaboration graph. These applications give empirical evidence that the Kähler angle contains important information about the structure of mixed graphs which is relevant for real-world applications in the study of complex networks., The author thanks financial support from Agencia Estatal de Investigaci¨an (AEI, MCI, Spain) MCIN/AEI/ 10.13039/501100011033 under grant PID2023-149473NB-I00 and by Agencia Estatal de Investigaci¨an (AEI, MCI, Spain) MCIN/AEI/ 10.13039/501100011033 and Fondo Europeo de Desarrollo Regional (FEDER, UE) under the Mar¨aa de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M). The referees are also acknowledged for their excellent revision of this manuscript which improved significantly its presentation. , With funding from the Spanish government through the "María de Maeztu Unit of Excellence" accreditation (CEX2021-001164-M), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Heterogeneous consensus dynamics through reaction–diffusion models on graphs/networks

  • Miranda, Manuel
  • Moreno-Spiegelberg, Pablo
  • Estrada, Ernesto
Consensus protocols (linear and nonlinear) are extensively used for multi-agent systems to perform a wide variety of tasks. Its connections with diffusive models make a natural bridge between engineering and social/natural complex systems. These protocols give rise to conservative processes on the graphs representing the systems, and reach homogeneous (consensus) steady states. Here we develop a model that extends the concept of global consensus (diffusion) to dynamical processes which are nonconservative on the graphs, and reach bounded steady states, which are not necessarily a global consensus. That is, they allow heterogeneous steady states in which different subsets of agents can reach a consensus among them, which may be different from the ones reached by other groups. We prove some mathematical results indicating how the structure of the graphs representing the system determines the final states of the dynamics. Finally, we illustrate the applications of the model by considering a heterogeneous rendezvous of a group of agents, as well as the connections of the model with the Bass model for diffusion of innovation and the Lotka–Volterra equations to model the evolution of groups of species that interact in different ways., The authors thank financial support from Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/ 10.13039/501100011033 and Fondo Europeo de Desarrollo Regional (FEDER, UE) under the María de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M). E.E. and M.M. thank Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/ 10.13039/501100011033 under grant PID2023-149473NB-I00. M.M. thanks financial support PRE2020-092875 by MCIN/AEI /10.13039/501100011033 and by FSE invierte en tu futuro ., 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 Artículo científico (JournalArticle)

Fractional Diffusion on Graphs: Superposition of Laplacian Semigroups Incorporating Memory

  • Deniskin, Nikita
  • Estrada, Ernesto
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. While the subordination representation and complete monotonicity properties of the Mittag-Leffler function are classical, we develop a graph-based synthesis in which Mittag-Leffler dynamics admit an exact convex, mass-preserving representation as a superposition of Laplacian semigroups evaluated at rescaled times. This perspective reveals fractional diffusion as ordinary diffusion acting across multiple intrinsic time scales and enables new structural and dynamical interpretations of graphs. 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 the recovery of global shortest paths, in contrast to the graph exploration of diffusive geometry, while simultaneously favoring high-degree regions. Finally, we show that time-fractional diffusion can be interpreted as a singular limit of multi-rate diffusion, in an appropriate asymptotic sense., This research was funded by Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/10.13039/501100011033 under grant PID2023-149473NB-I00 and by Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/10.13039/501100011033 and Fondo Europeo de Desarrollo Regional (FEDER, UE) under the María de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M) are also acknowledged., 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 Artículo científico (JournalArticle)

Graph/Network reduction based on communicability vertex similarity. A heuristic approach

  • Grass-Boada, Darian H.
  • Nuez, Rodrigo de la
  • Estrada, Ernesto
Reducing the size of large graphs while preserving the mechanisms that govern their dynamics remains a central challenge in network science. In this work, we introduce a graph reduction framework based on communicability-driven vertex similarity, in which pairs of structurally and dynamically equivalent vertices are iteratively merged. The method is designed to retain spectral quantities that act as proxies for diffusion, synchronization, and epidemic spreading, namely the algebraic connectivity, the Laplacian eigenratio, and the spectral radius of the adjacency matrix. We systematically evaluate the proposed approach across a diverse collection of real-world networks and benchmark it against seven representative state-of-the-art reduction techniques spanning different algorithmic paradigms. Our results show that the method enables substantially larger reductions in both vertices and edges while maintaining comparable or superior fidelity in the targeted spectral properties. Beyond average-case performance, we identify and analyze pathological scenarios associated with extreme bottleneck structures, clarify their structural origin, and propose practical strategies to mitigate their impact. Overall, the results demonstrate that communicability-based vertex merging provides a robust and flexible tool for aggressive graph reduction when the preservation of key dynamical signatures is required., EE thanks financial support from Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/10.13039/501100011033 under grant PID2023-149473NB-100 and by Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/10.13039/501100011033 and Fondo Europeo de Desarrollo Regional (FEDER, UE) under the María de Maeztu Program for Units of Excellence in R&D, grant CEX2021-001164-M., 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 Artículo científico (JournalArticle)

The Geometry of Quantum Walks on Graphs—Theory and Applications

  • Estrada, Ernesto
We introduce a geometric framework for continuous-time quantum walks on graphs by embedding each vertex into a Euclidean space through its time-dependent quantum probability distribution. This construction induces a rich geometry in which quantum transport is characterized by distances, radii, angles, and simplex volumes, allowing interference, localization, and spreading to be analyzed within a unified metric-angular formalism. We prove that, in contrast to classical diffusion, which collapses to a spherical geometry, quantum dynamics generate a generically non-spherical affine geometry with persistent anisotropy. Applying this theory to real-world networks—including transportation systems, semantic graphs, and neuronal connectomes—we show that quantum geometry reveals dynamically meaningful backbones, interference-based “communities”, and vulnerability structures that are invisible to classical random-walk and spectral methods. In particular, angular and radial quantum descriptors isolate functional hubs, control cores, and coherence classes without any topological or dimensionality assumptions. Together, these results demonstrate that quantum-walk-induced geometry provides a powerful new lens for understanding structure and function in complex networks., This research was funded by Ministerio de Ciencia, Innovación y Universidades, grant number PID2023-149473NB-I00., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

The Geometry of the Hückel/Tight-Binding Method for Modeling Molecular Systems

  • Bermúdez-Montaña, Marisol
  • Estrada, Ernesto
We present a geometric reformulation of the H\" uckel molecular orbital/tight-binding (HMO/TB) method that integrates tools from algebraic graph theory and statistical mechanics. By extending classical notions of charge density and bond order to incorporate bond orbital energies, we construct a probabilistic framework that embeds molecular graphs into Euclidean (pseudometric) space. This embedding introduces new geometric descriptors–such as internodal distances, node angles, and electronic propagation efficiency–that correlate with chemical properties including bond lengths, reactivity, and molecular stability. Analytical results for linear and cyclic polyenes as well as polycyclic aromatic hydrocarbons illustrate the utility of these descriptors and suggest a pathway toward closer integration of HMO/TB with ab initio methods and machine learning approaches in molecular modeling., The work of the second author was supported by Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/10.13039/501100011033 under grant PID2023-149473NB-I00 and by Agencia Estatal de Investigación (AEI, MCI, Spain) MCIN/AEI/ 10.13039/501100011033 and Fondo Europeo de Desarrollo Regional (FEDER, UE) under the María de Maeztu Program for units of Excellence in R&D, grant CEX2021-001164-M., With funding from the Spanish government through the "Maria de Maeztu Centre of Excellence" accreditation (CEX2021-001164-M)., Peer reviewed
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Local and nonlocal Laplacian diffusion on graphs with obstacles

  • Arto, Jaime
  • Estrada, Ernesto
We study the effect of obstacles on diffusion processes on finite path graphs from a linear algebraic perspective. An obstacle is modeled as a weighted self-loop on the path graph, and diffusion is governed by local and nonlocal Laplacian operators. We first analyze the spectral perturbation induced by the obstacle for the standard graph Laplacian and prove that, as the weight of the self-loop increases, the diffusive particle becomes effectively confined to a subregion of the graph. Surprisingly, we show that the same trapping phenomenon occurs for a broad class of nonlocal operators given by matrix functions, including fractional powers of the Laplacian. Although these operators are nonlocal, they inherit structural properties that prevent them from overcoming arbitrarily strong obstacles. In contrast, we prove that transformed d-path Laplacians—particularly the Mellin-transformed operator—overcome obstacles of arbitrary weight. This distinction is explained through spectral decomposition and block diagonalization techniques. Our results establish a sharp structural difference between matrix functions and transformed d-path Laplacians and provide a general framework for modeling nonlocal diffusion on graphs with barriers.