Fabián Aguirre-López
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fabián Aguirre-López has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
Anthony C C Coolen
Department of Mathematics, King's College London, London, London, UNITED KINGDOM OF GREAT BRITAIN AND NORTHERN IRELAND
2 shared publications- Anthony C. C. Coolen
Theoretical Biophysics, DCN Donders Institute, Faculty of Science, Radboud University, 6525 AJ Nijmegen, The Netherlands
2 shared publications - Mauro Pastore
The Abdus Salam International Centre for Theoretical Physics Strada Costiera 11
2 shared publications - Alessandro Salvatore
Ladhyx
1 shared publication - Alexander Mozeika
London Institute for Mathematical Sciences W1K 2XF London United Kingdom
1 shared publication - Blas Kolic
Institute for New Economic Thinking at the Oxford Martin School University of Oxford
1 shared publication
Latest Publications
- 25 August 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (2) , 024306
Patterns robust to disorder in spatially interacting generalized Lotka-Volterra ecosystems
How do interactions between species influence their spatial distribution in an ecosystem? To answer this question, we introduce a spatially extended ecosystem of generalized Lotka-Volterra type, where species can diffuse and interactions are nonlocal. We compute the criterion for the loss of stability of the spatially homogeneous ecosystem, and we show that the stability of the uniform state crucially depends on the most abundant species, and on the interplay between space exploration during the timescale of reproduction and the interaction range. Focusing on the spectrum of the interaction matrix weighted by the species abundances, we identify a Baik-Ben Arous-Péché transition that translates into a transition in the final patterns of the species distribution. Finally assuming that the disorder is small, we exhibit an explicit solution of the dynamical mean-field equation for the species density, obtained as the fixed point of nonlocal Fisher-Kolmogorov-Petrovski-Piskounov equations. Our work paves the way of future combined approaches at the frontier of active matter and disordered systems, with the hope of better understanding complex ecosystems like bacterial communities.
- 25 August 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (2) , 024306
Patterns robust to disorder in spatially interacting generalized Lotka-Volterra ecosystems
How do interactions between species influence their spatial distribution in an ecosystem? To answer this question, we introduce a spatially extended ecosystem of generalized Lotka-Volterra type, where species can diffuse and interactions are nonlocal. We compute the criterion for the loss of stability of the spatially homogeneous ecosystem, and we show that the stability of the uniform state crucially depends on the most abundant species, and on the interplay between space exploration during the timescale of reproduction and the interaction range. Focusing on the spectrum of the interaction matrix weighted by the species abundances, we identify a Baik-Ben Arous-Péché transition that translates into a transition in the final patterns of the species distribution. Finally assuming that the disorder is small, we exhibit an explicit solution of the dynamical mean-field equation for the species density, obtained as the fixed point of nonlocal Fisher-Kolmogorov-Petrovski-Piskounov equations. Our work paves the way of future combined approaches at the frontier of active matter and disordered systems, with the hope of better understanding complex ecosystems like bacterial communities.
- Open Access
- 31 January 2025
- Published by Stichting SciPost in SciPost Physics
- Vol. 18 (1) , 039
Random features and polynomial rules
Random features models play a distinguished role in the theory of deep learning, describing the behavior of neural networks close to their infinite-width limit. In this work, we present a thorough analysis of the generalization performance of random features models for generic supervised learning problems with Gaussian data. Our approach, built with tools from the statistical mechanics of disordered systems, maps the random features model to an equivalent polynomial model, and allows us to plot average generalization curves as functions of the two main control parameters of the problem: the number of random features N N and the size P P of the training set, both assumed to scale as powers in the input dimension D D . Our results extend the case of proportional scaling between N N , P P and D D . They are in accordance with rigorous bounds known for certain particular learning tasks and are in quantitative agreement with numerical experiments performed over many order of magnitudes of N N and P P . We find good agreement also far from the asymptotic limits where D\to ∞ D → ∞ and at least one between P/D^K P / D K , N/D^L N / D L remains finite.
- 31 January 2025
- Published by Stichting SciPost in SciPost Physics
- Vol. 18 (1) , 039
Open AccessRandom features and polynomial rules
Random features models play a distinguished role in the theory of deep learning, describing the behavior of neural networks close to their infinite-width limit. In this work, we present a thorough analysis of the generalization performance of random features models for generic supervised learning problems with Gaussian data. Our approach, built with tools from the statistical mechanics of disordered systems, maps the random features model to an equivalent polynomial model, and allows us to plot average generalization curves as functions of the two main control parameters of the problem: the number of random features N N and the size P P of the training set, both assumed to scale as powers in the input dimension D D . Our results extend the case of proportional scaling between N N , P P and D D . They are in accordance with rigorous bounds known for certain particular learning tasks and are in quantitative agreement with numerical experiments performed over many order of magnitudes of N N and P P . We find good agreement also far from the asymptotic limits where D\to ∞ D → ∞ and at least one between P/D^K P / D K , N/D^L N / D L remains finite.
- 4 November 2024
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 133 (19) , 197101
Bringing Together Two Paradigms of Nonequilibrium: Fragile versus Robust Aging in Driven Glassy Systems
There are two key paradigms for nonequilibrium dynamics: on the one hand, aging toward an equilibrium state that cannot be reached on reasonable timescales; on the other, external driving that can lead to nonequilibrium steady states. We explore how these two mechanisms interact by studying the behavior of trap models, which are paradigmatic descriptions of slow glassy dynamics, when driven by trajectory bias toward high or low activity. To diagnose whether the driven systems continue to age, we establish a framework for mapping the biased dynamics to a Markovian time evolution with time-dependent transition rates. We find that the original aging dynamics reacts in two qualitatively distinct ways to the driving: it can be destroyed by the driving of any nonzero strength ("fragile" aging), whereby the dynamics either reaches an active steady state or effectively freezes, or it can persist within a finite range of driving strengths around the undriven case ("robust" aging). This classification into fragile and robust aging could form the basis for distinguishing different universality classes of aging dynamics.
- 4 November 2024
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 133 (19) , 197101
Bringing Together Two Paradigms of Nonequilibrium: Fragile versus Robust Aging in Driven Glassy Systems
There are two key paradigms for nonequilibrium dynamics: on the one hand, aging toward an equilibrium state that cannot be reached on reasonable timescales; on the other, external driving that can lead to nonequilibrium steady states. We explore how these two mechanisms interact by studying the behavior of trap models, which are paradigmatic descriptions of slow glassy dynamics, when driven by trajectory bias toward high or low activity. To diagnose whether the driven systems continue to age, we establish a framework for mapping the biased dynamics to a Markovian time evolution with time-dependent transition rates. We find that the original aging dynamics reacts in two qualitatively distinct ways to the driving: it can be destroyed by the driving of any nonzero strength ("fragile" aging), whereby the dynamics either reaches an active steady state or effectively freezes, or it can persist within a finite range of driving strengths around the undriven case ("robust" aging). This classification into fragile and robust aging could form the basis for distinguishing different universality classes of aging dynamics.
- Open Access
- 13 August 2024
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 57 (34) , 345002
Heterogeneous mean-field analysis of the generalized Lotka–Volterra model on a network
We study the dynamics of the generalized Lotka–Volterra model with a network structure. Performing a high connectivity expansion for graphs, we write down a mean-field dynamical theory that incorporates degree heterogeneity. This allows us to describe the fixed points of the model in terms of a few simple order parameters. We extend the analysis even for diverging abundances, using a mapping to the replicator model. With this we present a unified approach for both cooperative and competitive systems that display complementary behaviors. In particular we show the central role of an order parameter called the critical degree, g c . In the competitive regime g c serves to distinguish high degree nodes that are more likely to go extinct, while in the cooperative regime it has the reverse role, it will determine the low degree nodes that tend to go relatively extinct.
- 13 August 2024
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 57 (34) , 345002
Open AccessHeterogeneous mean-field analysis of the generalized Lotka–Volterra model on a network
We study the dynamics of the generalized Lotka–Volterra model with a network structure. Performing a high connectivity expansion for graphs, we write down a mean-field dynamical theory that incorporates degree heterogeneity. This allows us to describe the fixed points of the model in terms of a few simple order parameters. We extend the analysis even for diverging abundances, using a mapping to the replicator model. With this we present a unified approach for both cooperative and competitive systems that display complementary behaviors. In particular we show the central role of an order parameter called the critical degree, g c . In the competitive regime g c serves to distinguish high degree nodes that are more likely to go extinct, while in the cooperative regime it has the reverse role, it will determine the low degree nodes that tend to go relatively extinct.
- Open Access
- 5 July 2024
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 5 (3) , 035001
The spectral boundary of block structured random matrices
Economic and ecological models can be extremely complex, with a large number of agents/species each featuring multiple interacting dynamical quantities. In an attempt to understand the generic stability properties of such systems, we define and study an interesting new matrix ensemble with extensive correlations, generalising the elliptic ensemble. We determine analytically the boundary of its eigenvalue spectrum in the complex plane, as a function of the correlations determined by the model at hand. We solve numerically our equations in several cases of interest, and show that the resulting spectra can take a surprisingly wide variety of shapes.
- 5 July 2024
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 5 (3) , 035001
Open AccessThe spectral boundary of block structured random matrices
Economic and ecological models can be extremely complex, with a large number of agents/species each featuring multiple interacting dynamical quantities. In an attempt to understand the generic stability properties of such systems, we define and study an interesting new matrix ensemble with extensive correlations, generalising the elliptic ensemble. We determine analytically the boundary of its eigenvalue spectrum in the complex plane, as a function of the correlations determined by the model at hand. We solve numerically our equations in several cases of interest, and show that the resulting spectra can take a surprisingly wide variety of shapes.
- Open Access
Quantifying the structure of controversial discussions with unsupervised methods: a look into the Twitter climate change conversation
Social media provides an essential platform for shaping and sharing opinions and consuming information in a decentralized way. However, users often interact with and are exposed to information mostly aligned with their beliefs, creating a positive feedback mechanism that reinforces those beliefs and excludes contrasting ones. In this paper, we study such mechanisms by analyzing the social network dynamics of controversial Twitter discussions using unsupervised methods that demand little computational power. Specifically, we focus on the retweet networks of the climate change conversation during 2019, when important climate social movements flourished. We find echo chambers of climate believers and climate skeptics that we identify based solely on the retweeting patterns of Twitter users. In particular, we study the information sources, or chambers, consumed by the audience of the leading users of the conversation. Users with similar (contrasting) ideological positions show significantly high (low)-overlapping chambers, resulting in a bimodal overlap distribution. Further, we uncover the ideological position of previously unobserved high-impact users based on how many audience members fall into either echo chamber. We uncover the ideology of more than half of the retweeting population as either climate believers or skeptics and find that the cross-group communication is small. Moreover, we find that, while the echo chamber structures are consistent throughout the year, most users inside the echo chambers change from one week to the next, suggesting that they are a stable emergent property of the Twittersphere. Interestingly, we detect a significant decrease in polarization and a significant increase on the number of climate skeptics that coincides with the main #FridaysForFuture strikes during September, 2019.
Open AccessQuantifying the structure of controversial discussions with unsupervised methods: a look into the Twitter climate change conversation
Social media provides an essential platform for shaping and sharing opinions and consuming information in a decentralized way. However, users often interact with and are exposed to information mostly aligned with their beliefs, creating a positive feedback mechanism that reinforces those beliefs and excludes contrasting ones. In this paper, we study such mechanisms by analyzing the social network dynamics of controversial Twitter discussions using unsupervised methods that demand little computational power. Specifically, we focus on the retweet networks of the climate change conversation during 2019, when important climate social movements flourished. We find echo chambers of climate believers and climate skeptics that we identify based solely on the retweeting patterns of Twitter users. In particular, we study the information sources, or chambers, consumed by the audience of the leading users of the conversation. Users with similar (contrasting) ideological positions show significantly high (low)-overlapping chambers, resulting in a bimodal overlap distribution. Further, we uncover the ideological position of previously unobserved high-impact users based on how many audience members fall into either echo chamber. We uncover the ideology of more than half of the retweeting population as either climate believers or skeptics and find that the cross-group communication is small. Moreover, we find that, while the echo chamber structures are consistent throughout the year, most users inside the echo chambers change from one week to the next, suggesting that they are a stable emergent property of the Twittersphere. Interestingly, we detect a significant decrease in polarization and a significant increase on the number of climate skeptics that coincides with the main #FridaysForFuture strikes during September, 2019.
- 7 July 2022
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 55 (30) , 305001
Satisfiability transition in asymmetric neural networks
Asymmetry in the synaptic interactions between neurons plays a crucial role in determining the memory storage and retrieval properties of recurrent neural networks. In this work, we analyze the problem of storing random memories in a network of neurons connected by a synaptic matrix with a definite degree of asymmetry. We study the corresponding satisfiability and clustering transitions in the space of solutions of the constraint satisfaction problem associated with finding synaptic matrices given the memories. We find, besides the usual SAT/UNSAT transition at a critical number of memories to store in the network, an additional transition for very asymmetric matrices, where the competing constraints (definite asymmetry vs memories storage) induce enough frustration in the problem to make it impossible to solve. This finding is particularly striking in the case of a single memory to store, where no quenched disorder is present in the system.
- 7 July 2022
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 55 (30) , 305001
Satisfiability transition in asymmetric neural networks
Asymmetry in the synaptic interactions between neurons plays a crucial role in determining the memory storage and retrieval properties of recurrent neural networks. In this work, we analyze the problem of storing random memories in a network of neurons connected by a synaptic matrix with a definite degree of asymmetry. We study the corresponding satisfiability and clustering transitions in the space of solutions of the constraint satisfaction problem associated with finding synaptic matrices given the memories. We find, besides the usual SAT/UNSAT transition at a critical number of memories to store in the network, an additional transition for very asymmetric matrices, where the competing constraints (definite asymmetry vs memories storage) induce enough frustration in the problem to make it impossible to solve. This finding is particularly striking in the case of a single memory to store, where no quenched disorder is present in the system.
- Open Access
- 21 May 2021
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 2 (3) , 035010
Transitions in random graphs of fixed degrees with many short cycles
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of three-cycles (triangles). We find that such ensembles generally exhibit two transitions, a clustering and a shattering transition, separating three distinct regimes. At the clustering transition, the graphs change from typically having only isolated cycles to forming cycle clusters. At the shattering transition the graphs break up into many small cliques to achieve the desired three-cycle density. The locations of both transitions depend nontrivially on the system size. We derive a general formula for the three-cycle density in the regime of isolated cycles, for graphs with degree distributions that have finite first and second moments. For bounded degree distributions we present further analytical results on cycle densities and phase transition locations, which, while non-rigorous, are all validated via MCMC sampling simulations. We show that the shattering transition is of an entropic nature, occurring for all three-cycle density values, provided the system is large enough.
- 21 May 2021
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 2 (3) , 035010
Open AccessTransitions in random graphs of fixed degrees with many short cycles
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of three-cycles (triangles). We find that such ensembles generally exhibit two transitions, a clustering and a shattering transition, separating three distinct regimes. At the clustering transition, the graphs change from typically having only isolated cycles to forming cycle clusters. At the shattering transition the graphs break up into many small cliques to achieve the desired three-cycle density. The locations of both transitions depend nontrivially on the system size. We derive a general formula for the three-cycle density in the regime of isolated cycles, for graphs with degree distributions that have finite first and second moments. For bounded degree distributions we present further analytical results on cycle densities and phase transition locations, which, while non-rigorous, are all validated via MCMC sampling simulations. We show that the shattering transition is of an entropic nature, occurring for all three-cycle density values, provided the system is large enough.
- 13 August 2020
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 53 (36) , 365001
Replica analysis of overfitting in generalized linear regression models
Nearly all statistical inference methods were developed for the regime where the number N of data samples is much larger than the data dimension p . Inference protocols such as maximum likelihood (ML) or maximum a posteriori probability (MAP) are unreliable if p = O ( N ) , due to overfitting. This limitation has for many disciplines with increasingly high-dimensional data become a serious bottleneck. We recently showed that in Cox regression for time-to-event data the overfitting errors are not just noise but take mostly the form of a bias, and how with the replica method from statistical physics one can model and predict this bias and the noise statistics. Here we extend our approach to arbitrary generalized linear regression models (GLM), with possibly correlated covariates. We analyse overfitting in ML/MAP inference without having to specify data types or regression models, relying only on the GLM form, and derive generic order parameter equations for the case of L 2 priors. Second, we derive the probabilistic relationship between true and inferred regression coefficients in GLMs, and show that, for the relevant hyperparameter scaling and correlated covariates, the L 2 regularization causes a predictable direction change of the coefficient vector. Our results, illustrated by application to linear, logistic, and Cox regression, enable one to correct ML and MAP inferences in GLMs systematically for overfitting bias, and thus extend their applicability into the hitherto forbidden regime p = O ( N ) .
- 13 August 2020
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 53 (36) , 365001
Replica analysis of overfitting in generalized linear regression models
Nearly all statistical inference methods were developed for the regime where the number N of data samples is much larger than the data dimension p . Inference protocols such as maximum likelihood (ML) or maximum a posteriori probability (MAP) are unreliable if p = O ( N ) , due to overfitting. This limitation has for many disciplines with increasingly high-dimensional data become a serious bottleneck. We recently showed that in Cox regression for time-to-event data the overfitting errors are not just noise but take mostly the form of a bias, and how with the replica method from statistical physics one can model and predict this bias and the noise statistics. Here we extend our approach to arbitrary generalized linear regression models (GLM), with possibly correlated covariates. We analyse overfitting in ML/MAP inference without having to specify data types or regression models, relying only on the GLM form, and derive generic order parameter equations for the case of L 2 priors. Second, we derive the probabilistic relationship between true and inferred regression coefficients in GLMs, and show that, for the relevant hyperparameter scaling and correlated covariates, the L 2 regularization causes a predictable direction change of the coefficient vector. Our results, illustrated by application to linear, logistic, and Cox regression, enable one to correct ML and MAP inferences in GLMs systematically for overfitting bias, and thus extend their applicability into the hitherto forbidden regime p = O ( N ) .
- 21 January 2020
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 53 (6) , 065002
Imaginary replica analysis of loopy regular random graphs
We present an analytical approach for describing spectrally constrained maximum entropy ensembles of finitely connected regular loopy graphs, valid in the regime of weak loop-loop interactions. We derive an expression for the leading two orders of the expected eigenvalue spectrum, through the use of infinitely many replica indices taking imaginary values. We apply the method to models in which the spectral constraint reduces to a soft constraint on the number of triangles, which exhibit ‘shattering’ transitions to phases with extensively many disconnected cliques, to models with controlled numbers of triangles and squares, and to models where the spectral constraint reduces to a count of the number of adjacency matrix eigenvalues in a given interval. Our predictions are supported by MCMC simulations based on edge swaps with nontrivial acceptance probabilities.
- 21 January 2020
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 53 (6) , 065002
Imaginary replica analysis of loopy regular random graphs
We present an analytical approach for describing spectrally constrained maximum entropy ensembles of finitely connected regular loopy graphs, valid in the regime of weak loop-loop interactions. We derive an expression for the leading two orders of the expected eigenvalue spectrum, through the use of infinitely many replica indices taking imaginary values. We apply the method to models in which the spectral constraint reduces to a soft constraint on the number of triangles, which exhibit ‘shattering’ transitions to phases with extensively many disconnected cliques, to models with controlled numbers of triangles and squares, and to models where the spectral constraint reduces to a count of the number of adjacency matrix eigenvalues in a given interval. Our predictions are supported by MCMC simulations based on edge swaps with nontrivial acceptance probabilities.