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.
Year of publication: |
2007-04
|
---|---|
Authors: | Bassetti, Federico ; Leisen, Fabrizio |
Institutions: | Facoltà di Economia, Università degli Studi dell'Insubria |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Asymptotic results for a generalized Pòlya urn with delay and an applications to clinical trials
Crimanldi, Irene, (2007)
-
Beta-product dependent Pitman–Yor processes for Bayesian inference
Bassetti, Federico, (2014)
-
Beta-product dependent Pitman-Yor processes for Bayesian inference
Bassetti, Federico, (2013)
- More ...