The swapping algorithm for the Hopfield model with two patterns

Matthias Löwe and Franck Vermet

Stochastic Processes and their Applications, 2009, vol. 119, issue 10, 3471-3493

Abstract: The so-called swapping algorithm was designed to simulate from spin glass distributions, among others. In this note we show that it mixes rapidly, in a very simple disordered system, the Hopfield model with two patterns.

Keywords: Swapping; algorithm; Metropolis; algorithm; Hopfield; model; Markov; chain; Monte; Carlo; methods; Neural; networks; Spin; glasses (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304-4149(09)00111-2
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:119:y:2009:i:10:p:3471-3493

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().