The Hopfield model on a sparse Erdös-Renyi graph
From MaRDI portal
Publication:537898
DOI10.1007/s10955-011-0167-1zbMath1221.82054OpenAlexW2002679292MaRDI QIDQ537898
Publication date: 23 May 2011
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10955-011-0167-1
Related Items (4)
Multi-group binary choice with social interaction and a random communication structure -- a random graph approach ⋮ On the capacity of an associative memory model based on neural cliques ⋮ Graph Degree Sequence Solely Determines the Expected Hopfield Network Pattern Stability ⋮ Capacity of an associative memory model on random graph architectures
Cites Work
- Unnamed Item
- Lower bounds on the restitution error in the Hopfield model
- Ising models on locally tree-like graphs
- Gibbs measures and phase transitions on sparse random graphs
- The eigenvalues of random symmetric matrices
- On the storage capacity of Hopfield models with correlated patterns
- Effect of connectivity in an associative memory model
- The retrieval phase of the Hopfield model: A rigorous analysis of the overlap distribution
- Rigorous bounds on the storage capacity of the dilute Hopfield model
- Rigorous results for the Hopfield model with many patterns
- The capacity of \(q\)-state Potts neural networks with parallel retrieval dynamics
- Rigorous results on the thermodynamics of the dilute Hopfield model
- Fluctuations of the free energy in the diluted SK-model
- Large deviations of the free energy in diluted mean-field spin-glass
- The capacity of the Hopfield associative memory
- The Largest Eigenvalue of Sparse Random Graphs
- Sharp upper bounds on perfect retrieval in the Hopfield model
- Spectral techniques applied to sparse random graphs
- On the critical capacity of the Hopfield model.
This page was built for publication: The Hopfield model on a sparse Erdös-Renyi graph
