Slowly evolving random graphs II: adaptive geometry in finite-connectivity Hopfield models
From MaRDI portal
Publication:4654604
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41) Dynamics of disordered systems (random Ising systems, etc.) in time-dependent statistical mechanics (82C44) Neural nets applied to problems in time-dependent statistical mechanics (82C32)
Abstract: We present an analytically solvable random graph model in which the connections between the nodes can evolve in time, adiabatically slowly compared to the dynamics of the nodes. We apply the formalism to finite connectivity attractor neural network (Hopfield) models and we show that due to the minimisation of the frustration effects the retrieval region of the phase diagram can be significantly enlarged. Moreover, the fraction of misaligned spins is reduced by this effect, and is smaller than in the infinite connectivity regime. The main cause of this difference is found to be the non-zero fraction of sites with vanishing local field when the connectivity is finite.
Recommendations
- An evolving random network and its asymptotic structure
- Coarse geometry of evolving networks
- scientific article; zbMATH DE number 3173143
- The Evolution of Random Graphs
- The Hopfield model on a sparse Erdös-Renyi graph
- scientific article; zbMATH DE number 3168330
- The Little–Hopfield model on a sparse random graph
- On resilience of connectivity in the evolution of random graphs
- Evolution of scale-free random graphs: Potts model formulation
- Dynamics of stochastic neuronal networks and the connections to random graph theory
Cited in
(1)
This page was built for publication: Slowly evolving random graphs II: adaptive geometry in finite-connectivity Hopfield models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4654604)
