The swapping algorithm for the Hopfield model with two patterns (Q734648): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.spa.2009.06.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078348206 / rank | |||
Normal rank | |||
Revision as of 23:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The swapping algorithm for the Hopfield model with two patterns |
scientific article |
Statements
The swapping algorithm for the Hopfield model with two patterns (English)
0 references
13 October 2009
0 references
The swapping algorithm based on Metropolis - Hastings chain is introduced. The aim is to analyze the speed of convergence. The main result of the paper is that the swapping algorithm is rapidly mixing for a Hopfield network with two independent identical patterns. Some bounds for the spectral gap of the corresponding Markov chain are proved.
0 references
swapping algorithm
0 references
Metropolis algorithm
0 references
Hopfield model
0 references
Markov chain Monte Carlo method
0 references
spin glasses
0 references
