2013
DOI: 10.1103/physrevlett.110.118101
|View full text |Cite
|
Sign up to set email alerts
|

Topological and Dynamical Complexity of Random Neural Networks

Abstract: Random neural networks are dynamical descriptions of randomly interconnected neural units. These show a phase transition to chaos as a disorder parameter is increased. The microscopic mechanisms underlying this phase transition are unknown, and similarly to spin-glasses, shall be fundamentally related to the behavior of the system. In this Letter we investigate the explosion of complexity arising near that phase transition. We show that the mean number of equilibria undergoes a sharp transition from one equili… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

5
129
4

Year Published

2014
2014
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 116 publications
(140 citation statements)
references
References 34 publications
5
129
4
Order By: Relevance
“…The eigenspectrum of the weighted coupling matrix W of a neural network provides valuable information concerning the stability and behavior of a simulated model [1][2][3][4][5][6]: for example, the magnitude of the eigenvalue with the largest real part places limits on the linear stability of a network or of network partitions [1,3,5,7]; the existence and magnitude of complex eigenvalues determine whether oscillatory network dynamics are expressed [4,[8][9][10]. Numerically computing eigenvalues for small networks is trivial, but analytical eigenvalue solutions for matrices corresponding to even small nonsymmetric networks with relatively simple structure rapidly become intractable [10].…”
mentioning
confidence: 99%
“…The eigenspectrum of the weighted coupling matrix W of a neural network provides valuable information concerning the stability and behavior of a simulated model [1][2][3][4][5][6]: for example, the magnitude of the eigenvalue with the largest real part places limits on the linear stability of a network or of network partitions [1,3,5,7]; the existence and magnitude of complex eigenvalues determine whether oscillatory network dynamics are expressed [4,[8][9][10]. Numerically computing eigenvalues for small networks is trivial, but analytical eigenvalue solutions for matrices corresponding to even small nonsymmetric networks with relatively simple structure rapidly become intractable [10].…”
mentioning
confidence: 99%
“…The motivation of going beyond pure mean-field interactions comes from the biological observation that neurons do not interact in a mean-field way (see [11,41] and references therein). There has been recently a growing interest in models closer to the topology of real neuronal networks [21,35,41].…”
Section: Weakly Interacting Diffusionsmentioning
confidence: 99%
“…The motivation of going beyond pure mean-field interactions comes from the biological observation that neurons do not interact in a mean-field way (see [11,41] and references therein). There has been recently a growing interest in models closer to the topology of real neuronal networks [21,35,41]. Even though the analysis of such models seems to be difficult in general, it is quite natural to expect that properties valid in the pure mean-field case (the first of them being the existence of a continuous limit in an infinite population) still hold for perturbations of the mean-field case, namely for systems where the interactions are not strictly identical, but where the number of connections is sufficiently large to ensure some self-averaging as the population size increases.…”
Section: Weakly Interacting Diffusionsmentioning
confidence: 99%
“…More specifically, our networks always showed chaotic 291 behavior at some g values regardless of the dynamics of the isolated nodes. This is not 292 surprising, as chaotic behavior arises in networks of very simple units and seems to 293 depend more strongly on other factors such as synaptic weights and network 294 topology [25][26][27]52]. Moreover, just the high-dimensionality of the systems seems to be 295 enough to assure that chaos will emerge under some conditions, for example, the 296 quasiperiodic route to chaos in high-dimensional systems [53].…”
mentioning
confidence: 99%