Abstract
The dynamics of stochastic neural networks are presented. The model is an algorithm based upon the assumption that the activities of neurons are asynchronous. It is proven that networks with fixed synaptic efficacies cannot sustain oscillating activities. Following Choi and Huberman, the dynamics of instantaneous frequencies is derived. The equations are solved for associative and for recursive networks by introducing order parameters coupled to stored patterns. It is shown that the networks relax towards one of the stored configurations in a matter of a few refractory periods, whatever the size of the network. The relaxation time diverges in recursive networks at a critical noise Bc, above which no stored pattern can be retrieved. These results have been confirmed using computer simulations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Systems, Man, and Cybernetics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
