The Hopfield model on a sparse Erdös-Renyi graph (Q537898)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The Hopfield model on a sparse Erdös-Renyi graph
scientific article

    Statements

    The Hopfield model on a sparse Erdös-Renyi graph (English)
    0 references
    0 references
    0 references
    23 May 2011
    0 references
    The storage capacity of the Hopfield model on a sparse \(G(N,p)\) random graph is analyzed. The Hopfield model is well known to be a spin glass on the one hand, but also to model a neural network, on the other. It is proved that the storage capacity is proportional to \(\alpha p N\) (with \(\alpha\leq \alpha_c=0.03\)) in the entire regime where the corresponding random graph is asymptotically connected.
    0 references
    Hopfield model
    0 references
    Erdös-Renyi graph
    0 references
    random matrix
    0 references
    spectral theory
    0 references
    statistical mechanics
    0 references

    Identifiers