Search arXivSearch

arXiv · 2606.25826

Weight geometry governs functional memory in complex systems

Abstract

Complex systems, from gene regulatory networks to neural circuits and ecological food webs, exhibit rich functional behaviour that topology alone does not capture. Yet functional complexity remains difficult to quantify independently of structural organisation. Here we introduce a thermodynamic framework in which functional complexity is characterised through the hierarchical organisation of functional memory, quantifying how the influence of past interactions is distributed and progressively compressed across scales. Across thirty-four empirical networks spanning biological, ecological, social, technological, and biophysical systems and several orders of magnitude in size and density, real interaction strengths organise functional memory at greater hierarchical depth than random weight assignment on the same topology in every domain studied. The framework further reveals that functional memory occupies a remarkably low-dimensional space, collapsing onto four recurrent dynamical organisations. Comparisons with null models that selectively perturb weighted transport geometry, mesoscale wiring, and directionality show that these structural ingredients play distinct roles: weighted transport geometry systematically governs memory depth, whereas mesoscale wiring organises memory across scales and directionality modulates the response of the cascade to structural perturbation. The same comparisons provide an operational criterion for determining whether network weights encode functionally meaningful structure beyond topology. These results establish weighted transport geometry as a primary organiser of functional memory and provide a quantitative framework for studying functional complexity in directed weighted networks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elkaïoum M. Moutuou, Habib Benali. 2026-07-22. Weight geometry governs functional memory in complex systems. https://arxiv.org/abs/2606.25826

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

R-transforms for non-Hermitian matrices: a spherical integral approach

In this paper, we establish a connection between the formalism of $\mathcal{R}$-transforms for non-Hermitian random matrices and the framework of spherical integrals, using the replica method. This connection was previously proved in the Hermitian setting and in the case of bi-invariant random matrices. We show that the $\mathcal{R}$-transforms used in the non-Hermitian context in fact originate from a single scalar function of two variables. This provides a new and transparent way to compute $\mathcal{R}$-transforms, which until now had been known only in restricted cases such as bi-invariant, Hermitian, or elliptic ensembles.

cond-mat.dis-nn

Spectral boundaries of deterministic matrices deformed by rotationally invariant random non-Hermitian ensembles

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic solutions. In this paper, we illustrate this phenomenon in the context of spectral boundaries (or spectral edges) for deformed random matrices. Specifically, we consider matrices of the form $\mathbf{A} + \mathbf{B}$, where $\mathbf{A}$ is a deterministic $N\times N$ matrix (not necessarily Hermitian) and $\mathbf{B}$ is a rotationally invariant random matrix. In the large-$N$ limit, we show that the complex eigenvalue distribution of $\mathbf{A} + \mathbf{B}$ satisfies remarkably simple boundary equations that depend on the $\mathcal{R}_1$ and $\mathcal{R}_2$ transforms of $\mathbf{B}$. We illustrate our results on several explicit random matrix ensembles and support them with numerical simulations.

cond-mat.dis-nn

Electrical conductivity of crack-template-based transparent conducting films: mean-field approximation, effective-medium theory, and simulation

In this work, crack-template-based transparent conducting films were modeled as networks corresponding to the edges of a two-dimensional Poisson--Voronoi diagram. Two types of networks were considered: the original one, in which the conductance of each edge was inversely proportional to its length, and the effective one, in which all edges had the same conductance obtained from the effective-medium theory. The mean-field approximation was used for analytical evaluation of the electrical conductivity. Direct numerical calculations for the Poisson--Voronoi diagram showed that the mean-field approximation overestimated the effective conductivity of the original network by approximately 13\%, and of the effective network by 79\%. In addition, a honeycomb network with an edge conductance distribution corresponding to the Poisson--Voronoi diagram was studied: for it, the predictions of the effective-medium theory turned out to be more accurate than for the Poisson--Voronoi diagram, which was explained by the greater structural homogeneity of the periodic honeycomb lattice. The results indicate that, when modeling crack-template-based transparent conducting films, the application of the mean-field approximation may lead to significant errors if the resistance of individual conductors is not simply proportional to their length. This possibility is discussed as a motivation for future studies of hierarchical cracks with variable width, which are not directly investigated here.

cond-mat.dis-nn