Random Graphs In A Neural Computation Model

DOI10.1080/0020716031000079518zbMath1045.05513OpenAlexW1977967757MaRDI QIDQ4464413

Alexandros 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)

Related Items (3)

A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks ⋮ Memorization and Association on a Realistic Neural Model ⋮ The Hippocampus as a Stable Memory Allocator for Cortex

Cites Work

• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• The longest path in a random graph
• A graph-theoretic result for a model of neural computation
• A theory of the learnable
• Unnamed Item
• Unnamed Item
• Unnamed Item

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