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

DOI10.1007/S10955-011-0167-1zbMATH Open1221.82054OpenAlexW2002679292MaRDI QIDQ537898FDOQ537898

Franck Vermet, M. Löwe

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

zbMATH Keywords

random matrixspectral theoryHopfield modelstatistical mechanicsErdös-Renyi graph

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Cites Work

• Title not available (Why is that?)
• The eigenvalues of random symmetric matrices
• Ising models on locally tree-like graphs
• Rigorous results for the Hopfield model with many patterns
• The Largest Eigenvalue of Sparse Random Graphs
• The capacity of the Hopfield associative memory
• On the storage capacity of Hopfield models with correlated patterns
• The capacity of \(q\)-state Potts neural networks with parallel retrieval dynamics
• Sharp upper bounds on perfect retrieval in the Hopfield model
• Gibbs measures and phase transitions on sparse random graphs
• Spectral techniques applied to sparse random graphs
• Fluctuations of the free energy in the diluted SK-model
• 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 on the thermodynamics of the dilute Hopfield model
• Large deviations of the free energy in diluted mean-field spin-glass
• On the critical capacity of the Hopfield model.
• Lower bounds on the restitution error in the Hopfield model

Cited In (6)

• Graph Degree Sequence Solely Determines the Expected Hopfield Network Pattern Stability
• Sparse connection density underlies the maximal functional difference between random and scale-free networks
• Slowly evolving random graphs II: adaptive geometry in finite-connectivity Hopfield models
• On the capacity of an associative memory model based on neural cliques
• Multi-group binary choice with social interaction and a random communication structure -- a random graph approach
• Capacity of an associative memory model on random graph architectures

This page was built for publication: The Hopfield model on a sparse Erdös-Renyi graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537898)