Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T08:20:05.571Z Has data issue: false hasContentIssue false

Sharp upper bounds on perfect retrieval in the Hopfield model

Published online by Cambridge University Press:  14 July 2016

Anton Bovier*
Affiliation:
Weierstraß–Institut für Angewandte Analysis und Stochastik
*
∗ Postal address: WIAS, Mohrenstrasse 39, D-10117 Berlin, Germany. Email address: bovier@wias-berlin.de

Abstract

We prove a sharp upper bound on the number of patterns that can be stored in the Hopfield model if the stored patterns are required to be fixed points of the gradient dynamics. We also show corresponding bounds on the one-step convergence of the sequential gradient dynamics. The bounds coincide with the known lower bounds and confirm the heuristic expectations. The proof is based on a crucial idea of Loukianova (1997) using the negative association properties of some random variables arising in the analysis.

Information

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable