Capacity of an associative memory model on random graph architectures

DOI10.3150/14-BEJ630zbMath1326.60015arXiv1303.4542OpenAlexW3098059858MaRDI QIDQ2515521

Franck Vermet, Matthias Loewe

Publication date: 5 August 2015

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.4542

zbMATH Keywords

random graphsspectral theoryrandom matrixassociative memoryHopfield modelstatistical mechanicspower-law graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Information storage and retrieval of data (68P20)

Related Items (2)

A comparative study of sparse associative memories ⋮ Graph Degree Sequence Solely Determines the Expected Hopfield Network Pattern Stability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of edge-independent random graphs
• The Hopfield model on a sparse Erdös-Renyi graph
• On the spectra of general random graphs
• Geometric bounds for eigenvalues of Markov chains
• The eigenvalues of random symmetric matrices
• A lower bound for the memory capacity in the Potts-Hopfield model
• On the storage capacity of Hopfield models with correlated patterns
• Effect of connectivity in an associative memory model
• Rigorous bounds on the storage capacity of the dilute Hopfield model
• Rigorous results for the Hopfield model with many patterns
• Connected components in random graphs with given expected degree sequences
• Spontaneous scale-free structure of spike flow graphs in recurrent neural networks
• The fluctuations of the overlap in the Hopfield model with finitely many patterns at the critical temperature
• Spatial preferential attachment networks: power laws and clustering coefficients
• The capacity of \(q\)-state Potts neural networks with parallel retrieval dynamics
• The storage capacity of the Hopfield model and moderate deviations
• Rigorous results on the thermodynamics of the dilute Hopfield model
• The capacity of the Hopfield associative memory
• The storage capacity of the Blume–Emery–Griffiths neural network
• The Largest Eigenvalue of Sparse Random Graphs
• Nondirect convergence radius and number of iterations of the Hopfield associative memory
• Sharp upper bounds on perfect retrieval in the Hopfield model
• Spectral techniques applied to sparse random graphs
• Neural networks and physical systems with emergent collective computational abilities.
• The average distances in random graphs with given expected degrees
• Statistical Mechanics of Disordered Systems

This page was built for publication: Capacity of an associative memory model on random graph architectures