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

Source: [Mean-field dynamics of sequence processing neural networks with finite connectivity](<https://www.sota2.com/research/paper/68fa261c2c2a3760193b6ac3>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-24T11:09:37.332Z

Authors: W. K. Theumann

Published: 2003-03-20T18:12:40.000Z

## Abstract

A recent dynamic mean-field theory for sequence processing in fully connected neural networks of Hopfield-type (During, Coolen and Sherrington, 1998) is extended and analized 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/cond-mat/0303425>)

[PDF](<https://arxiv.org/pdf/cond-mat/0303425.pdf>)
