Metropolis Algorithm and equienergy sampling for two mean field spin systems
In this paper we study the Metropolis algorithm in connection with two mean–field spin systems, the so called mean–field Ising model and the Blume–Emery–Griffiths model. In both this examples the naive choice of proposal chain gives rise, for some parameters, to a slowly mixing Metropolis chain, that is a chain whose spectral gap decreases exponentially fast (in the dimension N of the problem). Here we show how a slight variant in the proposal chain can avoid this problem, keeping the mean computational cost similar to the cost of the usual Metropolis.
|Date of creation:||Apr 2007|
|Date of revision:|
|Contact details of provider:|| Postal: Via Ravasi 2-21100 Varese|
Web page: http://www.uninsubria.it/uninsubria/facolta/econo.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ins:quaeco:qf0704. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Segreteria Dipartimento)The email address of this maintainer does not seem to be valid anymore. Please ask Segreteria Dipartimento to update the entry or send us the correct email address
If references are entirely missing, you can add them using this form.