arXiv · cond-mat/0304021
Topology and Computational Performance of Attractor Neural Networks
Abstract
To explore the relation between network structure and function, we studied the computational performance of Hopfield-type attractor neural nets with regular lattice, random, small-world and scale-free topologies. The random net is the most efficient for storage and retrieval of patterns by the entire network. However, in the scale-free case retrieval errors are not distributed uniformly: the portion of a pattern encoded by the subset of highly connected nodes is more robust and efficiently recognized than the rest of the pattern. The scale-free network thus achieves a very strong partial recognition. Implications for brain function and social dynamics are suggestive.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Patrick N. Mcgraw, Michael Menzinger. 2003-04-01. Topology and Computational Performance of Attractor Neural Networks. https://doi.org/10.1103/physreve.68.047102
Cite the original work for its findings. Save a collection to share your selection of sources.