Mean-field dynamics of sequence processing neural networks with finite connectivity

W.K. Theumann

Physica A: Statistical Mechanics and its Applications, 2003, vol. 328, issue 1, 1-12

Abstract: A recent dynamic mean-field theory for sequence processing in fully connected neural networks of Hopfield-type is extended and analyzed here for a symmetrically diluted network with finite connectivity near saturation. Equations for the dynamics and the stationary states are obtained for the macroscopic observables and the precise equivalence is established with the single-pattern retrieval problem in a layered feed-forward network with finite connectivity.

Keywords: Neural networks; Sequence processing (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437103005697
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:328:y:2003:i:1:p:1-12

DOI: 10.1016/S0378-4371(03)00569-7

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().