Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Simple model of spiking neurons
IEEE Transactions on Neural Networks
Structural Properties of Recurrent Neural Networks
Neural Processing Letters
Spectra of the Spike Flow Graphs of Recurrent Neural Networks
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Robustness of plaws in degree distributions for spiking neural networks
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Persistent activation blobs in spiking neural networks with Mexican hat connectivity
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
Theoretical model for mesoscopic-level scale-free self-organization of functional brain networks
IEEE Transactions on Neural Networks
Diameter of the spike-flow graphs of geometrical neural networks
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
| Hi-index | 0.00 |
In this paper we introduce a simple and mathematically tractable model of an asynchronous spiking neural network which to some extent generalizes the concept of a Boltzmann machine. In our model we let the units contain a certain (possibly unbounded) charge, which can be exchanged with other neurons under stochastic dynamics. The model admits a natural energy functional determined by weights assigned to neuronal connections such that positive weights between two units favor agreement of their states whereas negative weights favor disagreement. We analyze energy minima (ground states) of the presented model and the graph of charge transfers between the units in the course of the dynamics where each edge is labeled with the count of unit charges (spikes) it transmitted. We argue that for independent Gaussian weights in low enough temperature the large-scale behavior of the system admits an accurate description in terms of a winner-take-all type dynamics which can be used for showing that the resulting graph of charge transfers, referred to as the spike flow graph in the sequel, has scale-free properties with power law exponent @c=2. Whereas the considered neural network model may be perceived to some extent simplistic, its asymptotic description in terms of a winner-take-all type dynamics and hence also the scale-free nature of the spike flow graph seem to be rather universal as suggested both by a theoretical argument and by numerical evidence for various neuronal models. As establishing the presence of scale-free self-organization for neural models, our results can also be regarded as one more justification for considering neural networks based on scale-free graph architectures.