Random Graphs In A Neural Computation Model

DOI10.1080/0020716031000079518MaRDI QIDQ4464413zbMATH OpenOpenAlexFDO

Authors A. V. Gerbessiotis

Publication date 27 May 2004

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020716031000079518

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A graph-theoretic result for a model of neural computation
• A theory of the learnable
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• scientific article; zbMATH DE number 4100386 (Why is no real title available?)
• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• The longest path in a random graph

Cited in

(3)

• A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks
• The hippocampus as a stable memory allocator for cortex
• Memorization and Association on a Realistic Neural Model

This page was built for publication: Random Graphs In A Neural Computation Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464413)