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)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.