Spectra of the Spike-Flow Graphs in Geometrically Embedded Neural Networks

Loading...
Thumbnail Image

Journal Title

Journal ISSN

Volume Title

Publisher

Springer Berlin Heidelberg

Abstract

In this work we study a simplified model of a neural activity flow in networks, whose connectivity is based on geometrical embedding, rather than being lattices or fully connected graphs. We present numerical results showing that as the spectrum (set of eigenvalues of adjacency matrix) of the resulting activity-based network develops a scale-free dependency. Moreover it strengthens and becomes valid for a wider segment along with the simulation progress, which implies a highly organised structure of the analysed graph.

Description

Full article available at Springerlink: http://link.springer.com/chapter/10.1007%2F978-3-642-29347-4_17 DOI: 10.1007/978-3-642-29347-4_17

Keywords

geometric neural networks, graph spectrum, scale-freeness

Citation

Lecture Notes in Computer Science Volume 7267, 2012, pp 143-151

Collections

Endorsement

Review

Supplemented By

Referenced By