Metropolis Algorithm and equienergy sampling for two mean field spin systems
Federico Bassetti () and
Additional contact information
Federico Bassetti: Department of Mathematics, University of Pavia, Italy
Fabrizio Leisen: Department of Economics, University of Insubria, Italy
Economics and Quantitative Methods from Department of Economics, University of Insubria
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.
References: View complete reference list from CitEc
Citations View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:ins:quaeco:qf0704
Access Statistics for this paper
More papers in Economics and Quantitative Methods from Department of Economics, University of Insubria Contact information at EDIRC.
Bibliographic data for series maintained by Segreteria Dipartimento ().