The Little-Hopfield model on a Random Graph

Abstract

We study the Hopfield model on a random graph in scaling regimes where the average number of connections per neuron is a finite number and where the spin dynamics is governed by a synchronous execution of the microscopic update rule (Little-Hopfield model).We solve this model within replica symmetry and by using bifurcation analysis we prove that the spin-glass/paramagnetic and the retrieval/paramagnetictransition lines of our phase diagram are identical to those of sequential dynamics.The first-order retrieval/spin-glass transition line follows by direct evaluation of our observables using population dynamics. Within the accuracy of numerical precision and for sufficiently small values of the connectivity parameter we find that this line coincides with the corresponding sequential one. Comparison with simulation experiments shows excellent agreement.

14 pages, 4 figures

References in corpus (2)

• On the nature of the low-temperature phase in discontinuous mean-field spin glasses
• Finite Connectivity Attractor Neural Networks

Cited by in corpus (18)

• Entropies of complex networks with hierarchically constrained topologies
• The Cavity Approach to Parallel Dynamics of Ising Spins on a Graph
• Finitely connected vector spin systems with random matrix interactions
• Cavity approach for real variables on diluted graphs and application to synchronization in small-world lattices
• Parallel dynamics of disordered Ising spin systems on finitely connected directed random graphs with arbitrary degree distributions
• Unperturbed Schelling segregation in two or three dimensions
• Spin models on random graphs with controlled topologies beyond degree constraints
• Reconstructing the Hopfield network as an inverse Ising problem
• Phase transitions in the three-state Ising spin-glass model with finite connectivity
• Transient Dynamics of Sparsely Connected Hopfield Neural Networks with Arbitrary Degree Distributions
• Ising spin glass in a random network with a gaussian random field
• Message passing algorithms for the Hopfield network reconstruction: threshold behavior and limitation
• Dynamics of sparse Boolean networks with multi-node and self-interactions
• Sparse Hopfield network reconstruction with ${\ell }_1$ regularization
• Combined update scheme in the Sznajd model
• Synchronous versus sequential updating in the three-state Ising neural network with variable dilution
• Gardner optimal capacity of the diluted Blume-Emery-Griffiths neural network
• Network Hierarchy and Pattern Recovery in Directed Sparse Hopfield Networks