Typical number and stability of equilibria in large non-reciprocal complex systems
summary
The gist
Typical number and stability of equilibria in large non-reciprocal complex systems is computed by comparing quenched complexity with annealed complexity to show that they only coincide in the fully…
In short
The study compares typical and average counts of equilibria in large non-reciprocal systems using quenched and annealed complexity. It finds that typical realizations have exponentially fewer equilibria than predicted by averages, showing that reciprocity affects stability and that average counting misses the true organization of fixed points.
Key concepts
- Quenched Complexity
- This measures the exponential growth rate of the number of equilibria found in a single, specific realization (typical system). It reveals how disorder statistics influence the actual number of fixed points present, unlike simpler averages.
- Annealed Complexity
- This is based on averaging over all possible realizations of the random force field. While it correctly predicts when an exponential number of equilibria might appear, it provides a biased view because it favors less stable equilibria in rare disorder samples.
- Non-Reciprocity Bias
- The asymmetry between components (non-reciprocity) drives the discrepancy between typical and average counts. This bias means that the ensemble average overestimates the total number of fixed points and incorrectly suggests that these points are less stable than they truly are in a specific realization.
Terminology used across episodes
This episode discusses
- Typical number and stability of equilibria in large non-reciprocal complex systems · Paper Radio
- Chaos in high-dimensional dynamical systems with tunable non-reciprocity
- On the relationship between equilibria and dynamics in large, random neuronal networks
The paper
Typical number and stability of equilibria in large non-reciprocal complex systems · Read on arXiv
King’s College London Department of Mathematics · Laboratoire de Physique de l’cole Normale Supérie, CNRS, ENS and PSL University, Sorbonne University, Paris Cité, Université Paris-Saclay
Transcript
Introduction to the show: ident: Condensed Matter. The day in condensed matter: materials, phases and the measurements under them.
Kai: We're looking at the paper: "Typical number and stability of equilibria in large non-reciprocal complex systems".
Mira: Here's the gist of the paper. Typical number and stability of equilibria in large non-reciprocal complex systems is computed by comparing quenched complexity with annealed complexity to show that they only coincide in the fully non-reciprocal limit The quenched calculation reveals a dependence on the statistics of the random force field and the degree of non-reciprocity, showing that average counting correctly locates the onset of an exponential number of equilibria but provides a biased description of their population Model Setup and Complexity Measures The study considers a prototypical model with N ≫ 1 coupled, autonomous ordinary differential equations subject to two competing terms: one favoring relaxation to a trivial equilibrium and another taking the form of a Gaussian force field promoting local equilibria The system dynamics are described by the equation ∂tx = f(x), fi(x) = −µixi + Fi(x), i = 1, · · ·, N, (1) where F(x) is a non-gradient field The complexity is quantified by the exponential growth rate of the typical number of equilibria, resolved by stability index, compared to the annealed complexity which is the exponential growth rate of the average number of equilibria Comparison between Typical and Average Counts The comparison shows that "typical realizations contain exponentially fewer equilibria than predicted by the average count" for any finite degree of reciprocity, and "Increasing reciprocity enhances the discrepancy between the two" The quenched complexity depends explicitly on the covariance of the random force field and on the degree of non-reciprocity, indicating that universality observed at the annealed level breaks down The average counting correctly identifies the location of the topology trivialization transition but fails to capture "the typical organization of equilibria near this transition, nor the stability index of the dominant equilibria" Quenched Complexity and Stability Index The total quenched complexity is given by Ξtot = Σtot − τ2(γ − 1)2v(γ)γ
1 + τv(γ): for γ ≥ 1 The quenched calculation uses the replicated Kac-Rice formalism to compute the exponential growth rate of the number of fixed points in typical realizations This complexity is related to the annealed complexity by Ξtot = Σtot − τ2(γ − 1)2v(γ)γ
1 + τv(γ): Role of Non-Reciprocity and Rare Events The discrepancy between quenched and annealed counting is driven by rare disorder realizations which bias the ensemble-average counting towards less stable equilibria, meaning "the annealed complexity is maximized by less stable equilibria, namely by fixed points with a larger index κ" The mechanism for this bias relies on the presence of a confining potential and translationally invariant statistics of random forces Non-reciprocity suppresses rare-sample bias, while reciprocity enhances it, leading to the conclusion that "the discrepancy between annealed and quenched counting grows with τ" Stability of the Replica Symmetric Assumption The stability of the replica symmetric assumption is checked by examining the replicon eigenvalue Λr, which is negative throughout the tested phase-space where complexity is positive, indicating that "the RS ansatz is stable with respect to continuous RSB transition" The analysis shows that "the only instability of the RS ansatz arises from the replicon sector" The work suggests that the stable fixed points dominating typical realizations are more stable than those dominating the annealed count, and this difference is controlled by R(2∆0) = cτv(γ) A central next step is to connect these fixed-point statistics with the out-of-equilibrium dynamics of the system to determine if these exponentially numerous stable fixed points can qualitatively modify the dynamics, such as suppressing chaos The results provide a framework for analyzing out-of-equilibrium dynamics in high-dimensional systems made of many coexisting and interacting units Supplementary Information Details The supplementary information provides detailed derivations, such as the expression for the nth factorial moment of the number of equilibria with k unstable directions using a saddle-point method The final expression for the complexity is recovered by optimizing over κ (or equivalently z(κ)) to find the index κq with the largest typical number of equilibria Numerical simulations confirm that the replicon is negative throughout the full tested phase-space, supporting the stability of the RS ansatz The analysis shows that for τ = 0, quenched and annealed counting coincide because "the bias ¯ξ vanishes" The final expression for the total complexity is found by optimizing over κ (or equivalently z(κ)) to yield z(κ∗) =
1+τ γv(γ): /
√γ(1+τv(γ)): The variance of the total number of equilibria, Vtot, is shown to be positive for any γ > 1 and τ > 0 Mechanism Favoring Unstable Fixed Points in Annealed Counting The mechanism ensuring that the annealed calculation overestimates not only the total number of equilibria but also their instability is generic, relying on a confining potential and translationally invariant statistics of random forces The annealed average favors realizations with many fixed points, and because of positive correlations, these realizations have a larger average divergence ¯ξ, meaning "their fixed points are on average less stable" This effect is absent for τ = 0 where the bias vanishes Variance Analysis and Transition Behavior The variance of the total number of equilibria, Vtot, turns on quadratically at the trivialization transition γ = 1 for 0 < τ < 1, whereas for the gradient case τ = 1, "the quadratic contribution vanishes" The analysis shows that fluctuations of ln NN,tot are sub-extensive in the fully non-reciprocal limit where Vtot = 0 for all γ > 1 The probability to have zero equilibria goes to zero identically in the phase where Ξˆ(κ) = Ξ(κ) > 0 Final Summary of Complexity Expressions The final expression for the complexity is found by optimizing over κ (or equivalently z(κ)) to yield z(κ∗) =
1+τ γv(γ): /
√γ(1+τv(γ)): The total complexity is given by lim N→∞ ⟨ln NN,tot⟩ N = 1/2 ln γ − (γ − 1) (1 + τ γv(γ)) γ (1 + τv(γ)) The analysis shows that the discrepancy between quenched and annealed counting disappears at τ = 0, as well as for γ → ∞, where v(γ) → 0 References
1: Phuong L Nguyen, Francesco Pomati, and Rudolf P Rohr.
Kai: Inferring coexistence likelihood in changing environments from ecological time series.
Mira: Proceedings of the National Academy of Sciences, 122(28):e2417905122, 2025
4: Saurabh Vyas, Matthew D Golub, David Sussillo, and Krishna V Shenoy.
Kai: Computation through neural population dynamics.
Title and authors: Kai: The paper's title is "Typical number and stability of equilibria in large non-reciprocal complex systems," and the authors are Bertrand Lacroix-A-Chez-Toine, Pierre Le Doussal, and Valentina Ros.
Mira: They're coming from different places—mathematics, physics at ENS, and Paris Saclay—which is interesting because this paper bridges that gap between pure mathematics and actual physical dynamics.
Lev: I wonder how they are going to translate these abstract mathematical concepts into something that actually runs on real hardware.
Kai: Well, the title tells you right away that the focus isn't just on counting; it’s specifically about stability too, which is crucial for understanding what happens in a physical system.
Mira: They set up this model where one part favors relaxation to a trivial equilibrium and another part is this non-gradient field with tunable strength, which means you can control how non-reciprocal the interaction is.
Lev: If we look at the setup, it seems like they are trying to find conditions where we get an exponential number of fixed points before things just collapse into one stable state.
The paper's summary: Kai: So, what's this paper actually saying in terms of the results? They use a replicated Kac-Rice formalism to compute this quenched complexity.
Mira: They show that the quenched complexity depends explicitly on two things: the statistics of that random force field and how much non-reciprocity there is in the system.
Lev: That dependence on the force field statistics sounds like it means we can't just assume a universal result everywhere; it changes based on what kind of randomness you introduce.
Kai: Right. And they also found that the average counting correctly identifies when this topology trivialization transition happens, but it completely misses how those typical equilibria are actually organized near that transition point.
Mira: They're saying that the average count is good for locating the boundary where things change from one fixed point to many, but it fails to describe what those many states look like in reality.
The paper's improvements: Lev: The paper points out a couple of key areas for improvement, focusing on how the authors could extend these results beyond just counting.
Kai: One major suggestion is to connect these fixed-point statistics with the actual out-of-equilibrium dynamics of the system. They want to see if these exponentially numerous stable fixed points can actually cause things like chaos or suppress it.
Mira: That's a big leap, moving from static counting to dynamic behavior. They want to know if these many stable states dictate the long-term movement of the system when it's not settling down.
Lev: From an engineering point, that’s what I need to know for hardware design—if we have exponentially many states, the overhead for error correction or control becomes enormous unless we can characterize them simply.
Conclusion: Kai: So, to wrap up, the main thing is that the annealed count correctly identifies the onset of an exponential number of equilibria, but it gives a biased picture of what those actual fixed points look like.
Mira: And they show that increasing reciprocity actually makes this discrepancy bigger because it enhances rare-sample bias in the average counting.
Lev: The paper suggests we need to focus on characterizing the stability index—the number of eigenvalues of the Jacobian matrix with positive real part—among those typical fixed points.
Kai: Yeah, so the next step is figuring out how that stability index relates to things like R(two delta zero) and seeing if that dictates whether a system stays stable or becomes chaotic <ref:2611.08324#pg1>.
Mira: Ultimately, this paper gives us a framework for analyzing out-of-equilibrium dynamics in high-dimensional systems where many units interact.
Lev: We'll keep an eye on those connections to real hardware, because understanding the stability of these typical states is what determines if the system actually settles down or keeps fluctuating wildly.
More episodes
- 2610.32678-Probing the limits of materials design via a comprehensive crystal database of 14.6 million structures with 140 properties
- 2610.33595-Native-oxide-driven layer asymmetry, two-step switching and exchange bias in Co/Ir/Co trilayers
- 2503.19572-Spin models from nonlinear cellular automata
- 2606.23350-Irreversibility Enhances Quantum-Enhanced Markov-Chain Monte Carlo
- 2608.02744-Two-Parameter Ansatz for the Violation of Eigenstate Thermalization
- 2210.00806-Low- and high-energy localization landscapes for tight-binding Hamiltonians in two-dimensional lattices
- 2409.09625-Selective switch for band-edge alignments in pentagonal CdSeTe monolayer: Atom-valley locking
- 2606.20168-Norms, overlaps and Yangian descendants for the Haldane-Shastry spin chain
- 2512.19503-Strain-induced splitting of the CCDW-NCCDW phase transition in 1T-TaS 2
- 2307.12638-Strong localization of microwaves beyond two dimensions in aperiodic Vogel spirals