The Hopfield model on a sparse Erdös-Renyi graph (Q537898): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The storage capacity of the Hopfield model on a sparse \(G(N,p)\) random graph is analyzed. The Hopfield model is well known to be a spin glass on the one hand, but also to model a neural network, on the other. It is proved that the storage capacity is proportional to \(\alpha p N\) (with \(\alpha\leq \alpha_c=0.03\)) in the entire regime where the corresponding random graph is asymptotically connected. | |||
Property / review text: The storage capacity of the Hopfield model on a sparse \(G(N,p)\) random graph is analyzed. The Hopfield model is well known to be a spin glass on the one hand, but also to model a neural network, on the other. It is proved that the storage capacity is proportional to \(\alpha p N\) (with \(\alpha\leq \alpha_c=0.03\)) in the entire regime where the corresponding random graph is asymptotically connected. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Utkir A. Rozikov / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 82B41 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5898924 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Hopfield model | |||
Property / zbMATH Keywords: Hopfield model / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Erdös-Renyi graph | |||
Property / zbMATH Keywords: Erdös-Renyi graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random matrix | |||
Property / zbMATH Keywords: random matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
spectral theory | |||
Property / zbMATH Keywords: spectral theory / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
statistical mechanics | |||
Property / zbMATH Keywords: statistical mechanics / rank | |||
Normal rank |
Revision as of 09:29, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Hopfield model on a sparse Erdös-Renyi graph |
scientific article |
Statements
The Hopfield model on a sparse Erdös-Renyi graph (English)
0 references
23 May 2011
0 references
The storage capacity of the Hopfield model on a sparse \(G(N,p)\) random graph is analyzed. The Hopfield model is well known to be a spin glass on the one hand, but also to model a neural network, on the other. It is proved that the storage capacity is proportional to \(\alpha p N\) (with \(\alpha\leq \alpha_c=0.03\)) in the entire regime where the corresponding random graph is asymptotically connected.
0 references
Hopfield model
0 references
Erdös-Renyi graph
0 references
random matrix
0 references
spectral theory
0 references
statistical mechanics
0 references