pith. sign in

arxiv: 2605.15872 · v1 · pith:CLIAMCS2new · submitted 2026-05-15 · 🌊 nlin.CD · cond-mat.dis-nn· math.DS· nlin.AO

Symmetry breaking and high-dimensional chaos in sparse random networks of exact firing rate models

Pith reviewed 2026-05-19 17:30 UTC · model grok-4.3

classification 🌊 nlin.CD cond-mat.dis-nnmath.DSnlin.AO
keywords exact firing rate modelsnext-generation neural mass modelssparse random networkshigh-dimensional chaossymmetry breakingrandom matrix theorydirected networksneural population dynamics
0
0 comments X

The pith

Directed sparse networks of exact firing rate models produce high-dimensional chaos in both excitatory and inhibitory populations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper studies networks of exact firing rate models, also called next-generation neural mass models, where populations are connected by sparse random links that are either all excitatory or all inhibitory and have row-normalized weights. Linear stability analysis around the uniform asynchronous state yields a dispersion relation that ties the growth of spatial patterns to the eigenvalues of the connectivity matrix. Bounds from random matrix theory locate the parameter regions where the uniform state loses stability. In undirected networks only inhibitory cases develop stationary heterogeneous patterns through a winner-takes-all mechanism, whereas directed networks generate high-frequency rhythmic states in both excitatory and inhibitory cases. Direct simulations show these rhythmic states are high-dimensional chaotic attractors whose properties scale extensively with network size.

Core claim

In row-normalized sparse random directed networks the homogeneous fixed point of purely excitatory or purely inhibitory next-generation neural mass models loses stability inside specific parameter intervals, producing high-frequency oscillatory states; numerical integration demonstrates that these states are high-dimensional chaotic attractors with extensive Lyapunov spectra, while the corresponding undirected networks support only stationary symmetry-broken patterns in the inhibitory case.

What carries the argument

The dispersion relation from linear stability analysis of the homogeneous asynchronous state, which maps perturbation growth rates to the eigenvalues of the row-normalized sparse connectivity matrix; random-matrix-theory bounds on those spectra demarcate the instability regions for both directed and undirected topologies.

If this is right

  • Directed connectivity produces high-frequency oscillations even when all synapses are excitatory.
  • The chaotic attractors are extensive, so their dimension increases proportionally with network size.
  • Undirected networks restrict dynamics to stationary heterogeneous patterns only under all-inhibitory coupling.
  • Spectral bounds allow prediction of instability regions without computing every eigenvalue.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Directionality in connectivity may be a generic route to complex collective rhythms in large neural populations.
  • The winner-takes-all stationary states in undirected inhibitory networks could underlie simple decision-like computations.
  • Mixed excitatory-inhibitory extensions of the same architecture might display transitions between different chaotic regimes.

Load-bearing premise

The bounds supplied by random matrix theory correctly locate the instability thresholds of the spectra of row-normalized sparse random matrices for both directed and undirected cases.

What would settle it

Direct numerical computation of the full eigenvalue spectrum of a large row-normalized sparse random matrix to test whether the predicted instability boundaries match the observed onset of oscillations, or measurement of whether the Kaplan-Yorke dimension of the simulated attractors grows linearly with the number of populations.

Figures

Figures reproduced from arXiv: 2605.15872 by Pau Clusella.

Figure 1
Figure 1. Figure 1: FIG. 1. Two-parameter bifurcation diagram of the homogeneous sys [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Spectra of row-normalized connectivity matrices. (a,b) Scaling of the radius [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Two-parameter bifurcation diagrams of the coupled system [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Numerical validation of the bifurcation diagram. (a,b) Heatmaps of the spatial variability [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Dynamical landscape in the [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Lyapunov analysis of (1) in directed networks. (a,b,c) Twenty largest Lyapunov exponents computed numerically in a directed random [PITH_FULL_IMAGE:figures/full_fig_p008_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. (a-c) Average power spectra of variables [PITH_FULL_IMAGE:figures/full_fig_p008_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. Extensive chaos in system (1). (a,b) Full Lyapunov spectra for [PITH_FULL_IMAGE:figures/full_fig_p009_8.png] view at source ↗
read the original abstract

Exact firing rate models, also known as next-generation neural mass models (NG-NMMs), provide a rigorous description of the dynamics of neural populations. While in its simplest form a single population only displays fixed-point activity, multi-population models may display a range of different behaviors. In this work, we study the dynamics of all-excitatory or all-inhibitory NG-NMMs coupled through sparse random networks with row-normalized network topology. Linear stability analysis of the homogeneous states of the system, representing asynchronous neural activity, provides a dispersion relation linking the emergence of spatiotemporal dynamics to the spectra of the connectivity matrix. Using bounds from random matrix theory, we identify the parameter regions where instabilities occur. In undirected networks, only inhibitory systems produce heterogeneous stationary patterns, corresponding to a winner-takes-all mechanism. In directed networks, exotic rhythmic states with high frequencies emerge in both, excitatory and inhibitory systems. Numerical simulations reveal that these hectic oscillatory states correspond to high-dimensional chaos with extensive properties.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript analyzes the dynamics of next-generation neural mass models (exact firing rate models) on sparse random networks, considering all-excitatory and all-inhibitory cases in both directed and undirected topologies. Linear stability analysis of the homogeneous asynchronous fixed point produces a dispersion relation tied to the spectrum of the row-normalized connectivity matrix. Random matrix theory bounds are applied to locate instability thresholds. Undirected inhibitory networks yield heterogeneous stationary patterns via winner-takes-all symmetry breaking, while directed networks produce exotic high-frequency rhythmic states in both excitatory and inhibitory cases. Numerical simulations are presented as evidence that these states are high-dimensional chaotic attractors possessing extensive properties.

Significance. If the numerical results rigorously establish high-dimensional extensive chaos, the work would contribute to understanding how microscopic population models generate macroscopic chaotic dynamics in sparse networks, with potential relevance to cortical rhythms and symmetry breaking. The use of random matrix theory to obtain explicit instability bounds without free parameters is a methodological strength, and the focus on row-normalized sparse topologies aligns with biologically motivated connectivity.

major comments (1)
  1. [Numerical results section] Numerical results section: the claim that the hectic oscillatory states are high-dimensional chaos with extensive properties rests on qualitative descriptions of irregular time series and power spectra. To support extensivity, the manuscript must demonstrate that the number of positive Lyapunov exponents (or the Kaplan-Yorke dimension) scales linearly with network size N; without the full spectrum or finite-size scaling analysis, the distinction from low-dimensional chaos or long transients is not established and the central numerical claim remains unconfirmed.
minor comments (2)
  1. [Abstract] Abstract: the phrase 'high frequencies' for the rhythmic states should be quantified (e.g., relative to the intrinsic frequency of an isolated population) to allow readers to assess the claimed exotic character.
  2. [Linear stability analysis] Linear stability analysis: specify whether the dispersion relation is derived in the thermodynamic limit or includes 1/N corrections, given that sparse random matrices exhibit pronounced finite-size fluctuations that could shift the instability boundaries.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback on our manuscript. The major comment identifies a valid limitation in the current numerical evidence for high-dimensional extensive chaos. We address this point directly below and outline the revisions we will implement.

read point-by-point responses
  1. Referee: [Numerical results section] Numerical results section: the claim that the hectic oscillatory states are high-dimensional chaos with extensive properties rests on qualitative descriptions of irregular time series and power spectra. To support extensivity, the manuscript must demonstrate that the number of positive Lyapunov exponents (or the Kaplan-Yorke dimension) scales linearly with network size N; without the full spectrum or finite-size scaling analysis, the distinction from low-dimensional chaos or long transients is not established and the central numerical claim remains unconfirmed.

    Authors: We agree that the existing numerical results rely primarily on qualitative observations of irregular time series and power spectra, which is insufficient to rigorously establish extensivity or to exclude low-dimensional chaos and long transients. In the revised manuscript we will add a finite-size scaling analysis of the Lyapunov spectrum. Specifically, we will compute the full spectrum of Lyapunov exponents for several network sizes N and demonstrate that the number of positive exponents (or the Kaplan-Yorke dimension) scales linearly with N. This quantitative evidence will confirm the extensive character of the chaotic attractors and strengthen the central numerical claim. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected; derivations rely on independent standard methods

full rationale

The paper's core chain applies linear stability analysis to homogeneous states to obtain a dispersion relation tied to the connectivity matrix spectra, then invokes bounds from random matrix theory to delineate instability regions. These steps draw on external, pre-existing mathematical tools rather than reducing to self-defined quantities or parameters fitted within the paper. Numerical simulations are presented as direct observations of chaotic states, without any described reduction of predictions to fitted inputs or self-citation chains that would force the high-dimensional extensive chaos claim by construction. The approach remains self-contained against external benchmarks such as standard RMT and stability theory, with no load-bearing self-citations or ansatz smuggling evident from the provided derivation outline.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on linear stability analysis of homogeneous states and application of random matrix theory bounds to connectivity spectra; no free parameters or invented entities are explicitly introduced in the abstract description.

axioms (2)
  • standard math Linear stability analysis provides a dispersion relation linking spatiotemporal dynamics to the spectra of the connectivity matrix.
    Invoked in the abstract as the basis for identifying instabilities in homogeneous states.
  • domain assumption Bounds from random matrix theory can be used to identify parameter regions where instabilities occur in sparse random networks.
    Directly stated in the abstract for both undirected and directed cases.

pith-pipeline@v0.9.0 · 5708 in / 1273 out tokens · 36199 ms · 2026-05-19T17:30:22.760909+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

91 extracted references · 91 canonical work pages · 1 internal anchor

  1. [1]

    Undirected networks In undirected networksΛ k ∈Rfor allk= 1, . . . , N. In excitatory populations (J >0), Eq. (6) shows that Re[λk]≤Re[λ 1]. Sinceλ 1 corresponds to a perturbation along the homoge- neous manifold, the homogeneous fixed points that are stable within Eqs. (3) remain stable against nonhomogeneous per- turbations. In inhibitory networks (J <0...

  2. [2]

    Wenowturntoregression, i.e

    Directed networks In directed networks, mostΛ k are pairs of complex conju- gates. WritingΛ k = Λ (R) k +iΛ (I) k and using the algebraic expression for the principal value of a square root of a com- plex number, Eq. (6) reads: λ± k = 2v0± q a+ p a2 +b 2 (11) ±isign Λ(I) k q −a+ p a2 +b 2 where a=τ r 0JΛ(R) k −2(πτ r 0)2 andb=τ r 0JΛ(I) k . Therefore, tra...

  3. [3]

    Let’s define the perturbation vector ζ= (δr 1, δv1,

    Compact form The previous linear stability analysis can be expressed in a more compact form by using matrix notation and the Kro- necker product⊗. Let’s define the perturbation vector ζ= (δr 1, δv1, . . . , δrN , δvN)T = (ζ1, . . . , ζN)T ∈R 2N , The full set of coupled linear systems (A2) fori= 1, . . . , N now reads τ ˙ζ= (I N ⊗A+C⊗B)ζ. LetΛ = (Λ iδij)b...

  4. [4]

    Homogeneous system The stability of homogeneous fixed point to homogeneous perturbations is given byΛ1 = 1in Eq. (6). SettingRe[λ ± 1 ] = 0provides J= ∆2 2π2(τ r0)3 + 2π2(τ r0). This equation can be interpreted as a parametric curve forJ, withr 0 as a free parameter,J=J(r 0). Substituting this expression into (5) and solving forηprovides: η(r0) = −3∆2 (2π...

  5. [5]

    (9) forµand Eq

    Transverse instabilities in undirected networks Solving Eq. (9) forµand Eq. (5) forJgives the parametric curves for the(µ, J)diagram (blue curve in Fig. 3(a)): µ(r0) = 2J(r0) √ κ−1 −N −1 − ∆2 2π2(τ r0)3 −2π 2τ r0 J(r0)(1 + 2 √ κ−1 −N −1) , J(r0) =π 2τ r0 − η τ r0 − ∆2 4π2(τ r0)3 . Similarly, solving Eq. (9) forJand Eq. (5) forηgive the parametric curves f...

  6. [6]

    (11) and take the real part: Re[λ± k ] = 2v0+ q B+Acos(θ) + p A2 + 2ABcos(θ) +B 2 (B2) 12 where v0 =− ∆ 2πτ r0 , A= √ κ−1(1−µ)τ r 0J, B=τ r 0J µ−2(πτ r 0)2

    Transverse instabilities in directed networks As indicated in the main text, we substituteΛ k =µ+ (1− µ)eiθ√ κ−1 −N −1 in Eq. (11) and take the real part: Re[λ± k ] = 2v0+ q B+Acos(θ) + p A2 + 2ABcos(θ) +B 2 (B2) 12 where v0 =− ∆ 2πτ r0 , A= √ κ−1(1−µ)τ r 0J, B=τ r 0J µ−2(πτ r 0)2. We need to find the value ofθthat maximizes Eq. (B2): d dθ Re[λ± k ] = 0. ...

  7. [7]

    Ifθ 3,4 exist, they always correspond to eigenvalues with greatest or equal real part than those associated with θ2 =π

  8. [8]

    Therefore, in all cases the bifurcation boundary is obtained by substitutingθ 3,4 intoRe[λ ±] = 0

    The eigenvalue associated toθ 2 =πcrossing the imag- inary axis implies the existence ofθ 3,4. Therefore, in all cases the bifurcation boundary is obtained by substitutingθ 3,4 intoRe[λ ±] = 0. After some manipula- tions, this provides A2 + 8v2 0B= 0 or equivalently, Eq. (12). To obtain the red, salmon and pink curves in Fig. 3(a) we solve Eq. (12) forµan...

  9. [9]

    Montbrió, D

    E. Montbrió, D. Pazó, and A. Roxin, Macroscopic descrip- tion for networks of spiking neurons, Phys. Rev. X5, 021028 (2015)

  10. [10]

    T. B. Luke, E. Barreto, and P. So, Complete Classification of the Macroscopic Behavior of a Heterogeneous Network of Theta Neurons, Neural Computation25, 3207 (2013)

  11. [11]

    Coombes and Á

    S. Coombes and Á. Byrne, Next generation neural mass mod- els, inNonlinear dynamics in computational neuroscience (Springer, 2019) pp. 1–16

  12. [12]

    C. Bick, M. Goodfellow, C. R. Laing, and E. A. Martens, Un- derstanding the dynamics of biological and neural oscillator networks through exact mean-field reductions: a review, The 13 Journal of Mathematical Neuroscience10, 9 (2020)

  13. [13]

    Castaldo, R

    F. Castaldo, R. de Palma Aristides, P. Clusella, J. Garcia- Ojalvo, and G. Ruffini, Rosetta stone of neural mass models (2025), arXiv:2512.10982 [q-bio.NC]

  14. [14]

    Pietras, F

    B. Pietras, F. Devalle, A. Roxin, A. Daffertshofer, and E. Mont- brió, Exact firing rate model reveals the differential effects of chemical versus electrical synapses in spiking networks, Phys. Rev. E100, 042412 (2019)

  15. [15]

    D. S. Goldobin, M. di V olo, and A. Torcini, Reduction method- ology for fluctuation driven population dynamics, Phys. Rev. Lett.127, 038301 (2021)

  16. [16]

    Chen and S

    L. Chen and S. A. Campbell, Exact mean-field models for spik- ing neural networks with adaptation, Journal of Computational Neuroscience50, 445 (2022)

  17. [17]

    Clusella and E

    P. Clusella and E. Montbrió, Exact low-dimensional descrip- tion for fast neural oscillations with low firing rates, Physical Review E109, 014229 (2024)

  18. [18]

    Pyragas and K

    V . Pyragas and K. Pyragas, Mean-field equations for neural populations withq-gaussian heterogeneities, Phys. Rev. E105, 044402 (2022)

  19. [19]

    Pietras, P

    B. Pietras, P. Clusella, and E. Montbrió, Low-dimensional model for adaptive networks of spiking neurons, Physical Re- view E111, 014422 (2025)

  20. [20]

    Pazó and R

    D. Pazó and R. Cestnik, Low-dimensional dynamics of globally coupled complex Riccati equations: Exact firing-rate equations for spiking neurons with clustered substructure, Physical Re- view E111, L052201 (2025)

  21. [21]

    Cestnik, Two-phase quadratic integrate-and-fire neurons: Exact low-dimensional description for ensembles of finite- voltage neurons, Physical Review Research8, L012049 (2026)

    R. Cestnik, Two-phase quadratic integrate-and-fire neurons: Exact low-dimensional description for ensembles of finite- voltage neurons, Physical Review Research8, L012049 (2026)

  22. [22]

    Pazó and E

    D. Pazó and E. Montbrió, From quasiperiodic partial synchro- nization to collective chaos in populations of inhibitory neurons with delay, Phys. Rev. Lett.116, 238101 (2016)

  23. [23]

    Devalle, A

    F. Devalle, A. Roxin, and E. Montbrió, Firing rate equations re- quire a spike synchrony mechanism to correctly describe fast oscillations in inhibitory networks, PLoS Computational Biol- ogy13, 1 (2017)

  24. [24]

    Devalle, E

    F. Devalle, E. Montbrió, and D. Pazó, Dynamics of a large sys- tem of spiking neurons with synaptic delay, Phys. Rev. E98, 042214 (2018)

  25. [25]

    di V olo and A

    M. di V olo and A. Torcini, Transition from asynchronous to os- cillatory dynamics in balanced spiking networks with instanta- neous synapses, Phys. Rev. Lett.121, 128301 (2018)

  26. [26]

    Ratas and K

    I. Ratas and K. Pyragas, Noise-induced macroscopic oscilla- tions in a network of synaptically coupled quadratic integrate- and-fire neurons, Phys. Rev. E100, 052211 (2019)

  27. [27]

    Dumont and B

    G. Dumont and B. Gutkin, Macroscopic phase resetting-curves determine oscillatory coherence and signal transfer in inter- coupled neural circuits, PLOS Computational Biology15, 1 (2019)

  28. [28]

    Reyner-Parra and G

    D. Reyner-Parra and G. Huguet,Phase-locking patterns under- lying effective communication in exact firing rate models of neu- ral networks, preprint (Neuroscience, 2021)

  29. [29]

    Segneri, H

    M. Segneri, H. Bi, S. Olmi, and A. Torcini, Theta-nested gamma oscillations in next generation neural mass models, Frontiers in Computational Neuroscience14, 47 (2020)

  30. [30]

    H. Bi, M. Segneri, M. di V olo, and A. Torcini, Coexistence of fast and slow gamma oscillations in one population of inhibitory spiking neurons, Phys. Rev. Research2, 013042 (2020)

  31. [31]

    Clusella, E

    P. Clusella, E. Köksal-Ersöz, J. Garcia-Ojalvo, and G. Ruffini, Comparison between an exact and a heuristic neural mass model with second order synapses (2022)

  32. [32]

    Pyragas and K

    V . Pyragas and K. Pyragas, Effect of Cauchy noise on a net- work of quadratic integrate-and-fire neurons with non-Cauchy heterogeneities, Physics Letters A480, 128972 (2023)

  33. [33]

    Pietras, Pulse Shape and V oltage-Dependent Synchroniza- tion in Spiking Neuron Networks, Neural Computation36, 1476 (2024)

    B. Pietras, Pulse Shape and V oltage-Dependent Synchroniza- tion in Spiking Neuron Networks, Neural Computation36, 1476 (2024)

  34. [34]

    Mayora-Cebollero, R

    A. Mayora-Cebollero, R. Barrio, L. Li, C. Mayora-Cebollero, and L. Pérez, Dynamics of coupled neural populations: The role of synaptic dynamics, Chaos: An Interdisciplinary Journal of Nonlinear Science35, 063140 (2025)

  35. [35]

    Gerster, H

    M. Gerster, H. Taher, A. Škoch, J. Hlinka, M. Guye, F. Bar- tolomei, V . Jirsa, A. Zakharova, and S. Olmi, Patient-specific network connectivity combined with a next generation neu- ral mass model to test clinical hypothesis of seizure prop- agation, Frontiers in Systems Neuroscience15, 10.3389/fn- sys.2021.675272 (2021)

  36. [36]

    Y . S. Perl, G. Zamora-Lopez, E. Montbrió, M. Monge- Asensio, J. V ohryzek, S. Fittipaldi, C. G. Campo, S. Moguilner, A. Ibañez, E. Tagliazucchi, B. T. T. Yeo, M. L. Kringelbach, and G. Deco, The impact of regional heterogeneity in whole- brain dynamics in the presence of oscillations, Network Neuro- science7, 632–660 (2023)

  37. [37]

    Clusella, G

    P. Clusella, G. Deco, M. L. Kringelbach, G. Ruffini, and J. Garcia-Ojalvo, Complex spatiotemporal oscillations emerge from transverse instabilities in large-scale brain networks, PLOS Computational Biology19, e1010781 (2023)

  38. [38]

    Forrester, S

    M. Forrester, S. Petros, O. Cattell, Y . M. Lai, R. D. O’Dea, S. Sotiropoulos, and S. Coombes, Whole brain functional con- nectivity: Insights from next generation neural mass modelling incorporating electrical synapses, PLOS Computational Biol- ogy20, e1012647 (2024)

  39. [39]

    R. M. Delicado-Moll, G. Huguet, and P. Clusella, Emergent spatiotemporal dynamics in large-scale brain networks with next generation neural mass models, Physica D: Nonlinear Phe- nomena493, 135232 (2026)

  40. [40]

    Nakao and A

    H. Nakao and A. S. Mikhailov, Turing patterns in network- organized activator-inhibitor systems, Nature Physics6, 544 (2010)

  41. [41]

    Asllani, J

    M. Asllani, J. D. Challenger, F. S. Pavone, L. Sacconi, and D. Fanelli, The theory of pattern formation on directed net- works, Nature Communications5, 4517 (2014)

  42. [42]

    S. P. Muscinelli, W. Gerstner, and T. Schwalger, How single neuron properties shape chaotic dynamics and signal transmis- sion in random neural networks, PLOS Computational Biology 15, e1007122 (2019)

  43. [43]

    Then, the resulting system fordR i/dTanddV i/dtdepends only on the new parameters˜η=η/∆and ˜J=J/∆ 1/2

    Consider the new dependent variablesR i =τ r i/∆1/2 and Vi =v i/∆1/2, and the time rescalingT=t∆ 1/2/τ. Then, the resulting system fordR i/dTanddV i/dtdepends only on the new parameters˜η=η/∆and ˜J=J/∆ 1/2

  44. [44]

    Wilkinson,The Algebraic Eigenvalue Problem, Monographs on numerical analysis (Clarendon Press, 1967)

    J. Wilkinson,The Algebraic Eigenvalue Problem, Monographs on numerical analysis (Clarendon Press, 1967)

  45. [45]

    Erd ˝os and A

    P. Erd ˝os and A. Rényi, On random graphs. I., Publicationes Mathematicae Debrecen6, 290 (1959)

  46. [46]

    Bai and J

    Z. Bai and J. W. Silverstein,Spectral Analysis of Large Dimen- sional Random Matrices, Springer Series in Statistics (Springer New York, New York, NY , 2010)

  47. [47]

    E. P. Wigner, Random Matrices in Physics, SIAM Review9, 1 (1967)

  48. [48]

    V . L. Girko, Circular Law, Theory of Probability & Its Appli- cations29, 694 (1985)

  49. [49]

    Spectrum of large random reversible Markov chains: two examples

    C. Bordenave, P. Caputo, and D. Chafai, Spectrum of large random reversible Markov chains: two examples (2010), arXiv:0811.1097 [math]

  50. [50]

    Bordenave, P

    C. Bordenave, P. Caputo, and D. Chafaï, Circular law theorem 14 for random Markov matrices, Probability Theory and Related Fields152, 751 (2012)

  51. [51]

    Here we assume a strongly connected graph, i.e.,κ >log(N), thus the multiplicity ofΛ 1 is one

    The multiplicity of this eigenvalue coincides with the number of closed strongly connected components in the graph. Here we assume a strongly connected graph, i.e.,κ >log(N), thus the multiplicity ofΛ 1 is one

  52. [52]

    Ifκ→N, forJ >0one needs at leastJ≈(κ −1 −N −1)−1/4 since for largeJ,J≈π 2τ r0 (see Eq. (5)). ForJ <0, instabil- ities require, at least,J≈ −(κ −1 −N −1)−3/2

  53. [53]

    Pikovsky and A

    A. Pikovsky and A. Politi,Lyapunov Exponents: A Tool to Ex- plore Complex Dynamics(Cambridge University Press, Cam- bridge, 2016)

  54. [54]

    J. L. Kaplan and J. A. Yorke, Chaotic behavior of multidimen- sional difference equations, inFunctional Differential Equa- tions and Approximation of Fixed Points, edited by H.-O. Peit- gen and H.-O. Walther (Springer Berlin Heidelberg, Berlin, Heidelberg, 1979) pp. 204–227

  55. [55]

    Brunel and V

    N. Brunel and V . Hakim, Fast Global Oscillations in Networks of Integrate-and-Fire Neurons with Low Firing Rates, Neural Computation11, 1621 (1999)

  56. [56]

    Tiesinga and T

    P. Tiesinga and T. J. Sejnowski, Cortical enlightenment: Are attentional gamma oscillations driven by ing or ping?, Neuron 63, 727 (2009)

  57. [57]

    Buzsáki and X.-J

    G. Buzsáki and X.-J. Wang, Mechanisms of gamma oscilla- tions, Annual Review of Neuroscience35, 203 (2012)

  58. [58]

    Ruelle, Large volume limit of the distribution of characteris- tic exponents in turbulence, Communications in Mathematical Physics87, 287–302 (1982)

    D. Ruelle, Large volume limit of the distribution of characteris- tic exponents in turbulence, Communications in Mathematical Physics87, 287–302 (1982)

  59. [59]

    P. Manneville, Liapounov exponents for the kuramoto- sivashinsky model, inMacroscopic Modelling of Turbulent Flows: Proceedings of a Workshop Held at INRIA, Sophia- Antipolis, France, December 10–14, 1984(Springer, 1985) pp. 319–326

  60. [60]

    R. Livi, A. Politi, and S. Ruffo, Distribution of characteristic exponents in the thermodynamic limit, Journal of Physics A: Mathematical and General19, 2033 (1986)

  61. [61]

    Keefe, Properties of Ginzburg-Landau attractors associated with their Lyapunov vectors and spectra, Physics Letters A140, 317 (1989)

    L. Keefe, Properties of Ginzburg-Landau attractors associated with their Lyapunov vectors and spectra, Physics Letters A140, 317 (1989)

  62. [62]

    C. S. O’Hern, D. A. Egolf, and H. S. Greenside, Lyapunov spec- tral analysis of a nonequilibrium Ising-like transition, Physical Review E53, 3374 (1996)

  63. [63]

    D. A. Egolf, I. V . Melnikov, W. Pesch, and R. E. Ecke, Mech- anisms of extensive spatiotemporal chaos in Rayleigh–Bénard convection, Nature404, 733 (2000)

  64. [64]

    H.-w. Xi, R. Toral, J. D. Gunton, and M. I. Tribelsky, Extensive chaos in the nikolaevskii model, Phys. Rev. E62, R17 (2000)

  65. [65]

    M. R. Paul, M. I. Einarsson, P. F. Fischer, and M. C. Cross, Extensive chaos in rayleigh-bénard convection, Phys. Rev. E 75, 045203 (2007)

  66. [66]

    Monteforte and F

    M. Monteforte and F. Wolf, Dynamical entropy production in spiking neuron networks in the balanced state, Phys. Rev. Lett. 105, 268104 (2010)

  67. [67]

    Palmigiano, R

    A. Palmigiano, R. Engelken, and F. Wolf, Boosting of neu- ral circuit chaos at the onset of collective oscillations, eLife https://doi.org/10.7554/eLife.90378.1 (2022)

  68. [68]

    Engelken, F

    R. Engelken, F. Wolf, and L. F. Abbott, Lyapunov spectra of chaotic recurrent neural networks, Physical Review Research 5, 043044 (2023)

  69. [69]

    D. G. Clark, L. F. Abbott, and A. Litwin-Kumar, Dimension of Activity in Random Neural Networks, Physical Review Letters 131, 118401

  70. [70]

    Floriach, J

    P. Floriach, J. Garcia-Ojalvo, and P. Clusella, From chimeras to extensive chaos in networks of heterogeneous Kuramoto oscil- lator populations, Chaos: An Interdisciplinary Journal of Non- linear Science35, 023115 (2025)

  71. [71]

    Results for(µ, J) = (0.2,30)where also computed, but are not shown, as they are similar to those of(µ, J) = (0.2,−60)

  72. [72]

    Otherwise, increasingNwith fixedκ, would surpass the percolation threshold, leading to the emergence of several connected components

    Notice that, to enforce a robust network modelCforN→ ∞, one should restrict the generation of Erd ˝os-Rényi networks to strongly connected topologies. Otherwise, increasingNwith fixedκ, would surpass the percolation threshold, leading to the emergence of several connected components. Nonetheless, for κ= 10, networks with multiple components arise forN≈ eκ...

  73. [73]

    In fact, the connectivity matrixCis closely related to the normalized Laplacian of the network:D −1Ais similar to D−1/2AD−1/2, thus the spectra ofCand that of the normal- ized LaplacianL=I N +D −1/2AD−1/2 coincide up to linear transformations involvingµ

  74. [74]

    Sompolinsky, A

    H. Sompolinsky, A. Crisanti, and H. J. Sommers, Chaos in Ran- dom Neural Networks, Physical Review Letters61, 259

  75. [75]

    Kadmon and H

    J. Kadmon and H. Sompolinsky, Transition to Chaos in Random Neuronal Networks, Physical Review X5, 041030 (2015)

  76. [76]

    Crisanti and H

    A. Crisanti and H. Sompolinsky, Path integral approach to ran- dom neural networks, Physical Review E98, 062120 (2018)

  77. [77]

    Pazó, Discontinuous transition to chaos in a canonical ran- dom neural network, Physical Review E110, 014201 (2024)

    D. Pazó, Discontinuous transition to chaos in a canonical ran- dom neural network, Physical Review E110, 014201 (2024)

  78. [78]

    Strata and R

    P. Strata and R. Harvey, Dale’s principle, Brain Research Bul- letin50, 349 (1999)

  79. [79]

    F. L. Metz, Dynamical Mean-Field Theory of Complex Sys- tems on Sparse Directed Networks, Physical Review Letters 134, 037401 (2025)

  80. [80]

    Wong, A Recurrent Network Mechanism of Time Integra- tion in Perceptual Decisions, Journal of Neuroscience26, 1314 (2006)

    K.-F. Wong, A Recurrent Network Mechanism of Time Integra- tion in Perceptual Decisions, Journal of Neuroscience26, 1314 (2006)

Showing first 80 references.