Diameter of the spike-flow graphs of geometrical neural networks
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Berlin Heidelberg
Abstract
Average path length is recognised as one of the vital characteristics of random graphs and complex networks. Despite a rather sparse structure, some cases were reported to have a relatively short lengths between every pair of nodes, making the whole network available in just several hops. This small-worldliness was reported in metabolic, social or linguistic networks and recently in the Internet. In this paper we present results concerning path length distribution and the diameter of the spike-flow graph obtained from dynamics of geometrically embedded neural networks. Numerical results confirm both short diameter and average path length of resulting activity graph. In addition to numerical results, we also discuss means of running simulations in a concurrent environment.
Description
Full article is available at Springerlink:
http://link.springer.com/chapter/10.1007%2F978-3-642-31464-3_52
DOI: 10.1007/978-3-642-31464-3_52
Keywords
geometrical neural networks, path length distribution, small world graph, graph diameter
Citation
Lecture Notes in Computer Science, 7203, pp 511-520