Associative recall in non-randomly diluted neuronal networks
From MaRDI portal
Publication:1412876
DOI10.1016/J.PHYSA.2003.08.010zbMATH Open1029.92001arXivcond-mat/0302040OpenAlexW1990117704MaRDI QIDQ1412876FDOQ1412876
Authors: Luciano Da Fontoura Costa, Dietrich Stauffer
Publication date: 30 November 2003
Published in: Physica A (Search for Journal in Brave)
Abstract: The potential for associative recall of diluted neuronal networks is investigated with respect to several biologically relevant configurations, more specifically the position of the cells along the input space and the spatial distribution of their connections. First we put the asymmetric Hopfield model onto a scale-free Barabasi-Albert network. Then, a geometrical diluted architecture, which maps from L-bit input patterns into -neurons networks, with R=N/L<1 (we adopt R=0.1, 0.2 and 0.3), is considered. The distribution of the connections between cells along the one-dimensional input space follows a normal distribution centered at each cell, in the sense that cells that are closer to each other have increased probability to interconnect. The models also explicitly consider the placement of the neuronal cells along the input space in such a way that denser regions of that space tend to become denser, therefore implementing a special case of the Barabasi-Albert connecting scheme. The obtained results indicate that, for the case of the considered stimuli and noise, the network performance increases with the spatial uniformity of cell distribution.
Full work available at URL: https://arxiv.org/abs/cond-mat/0302040
Recommendations
- An associative network with spatially organized connectivity
- An efficient dilution strategy for constructing sparsely connected neural networks
- Associative networks with diluted patterns: dynamical analysis at low and medium load
- Sparse associative memory
- What determines the capacity of autoassociative memories in the brain?
Cites Work
Cited In (7)
- Complex networks: structure and dynamics
- Roles of dynamic linkage of stable attractors across cortical networks in recalling long-term memory
- An efficient dilution strategy for constructing sparsely connected neural networks
- Scaling Laws of Associative Memory Retrieval
- Accessibility in complex networks
- Context-dependent associations in linear distributed memories
- Title not available (Why is that?)
This page was built for publication: Associative recall in non-randomly diluted neuronal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1412876)