Topological pattern selection in recurrent networks
From MaRDI portal
Publication:448311
DOI10.1016/J.NEUNET.2012.02.037zbMath1250.92002DBLPjournals/nn/BahrainiA12OpenAlexW2061199987WikidataQ48000472 ScholiaQ48000472MaRDI QIDQ448311
Abdolhossein Abbassian, Alireza Bahraini
Publication date: 30 August 2012
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2012.02.037
Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Neural biology (92C20) Systems biology, networks (92C42)
Cites Work
- Weighted graph Laplacians and isoperimetric inequalities
- An associative network with spatially organized connectivity
- Parallel dynamics of disordered Ising spin systems on finitely connected directed random graphs with arbitrary degree distributions
- Self-consistent signal-to-noise analysis and its application to analogue neural networks with asymmetric connections
- Slowly evolving connectivity in recurrent neural networks: I. The extreme dilution regime
- What determines the capacity of autoassociative memories in the brain?
- Spectra of random graphs with given expected degrees
This page was built for publication: Topological pattern selection in recurrent networks