Mixing times for the swapping algorithm on the Blume-Emery-Griffiths model
type: Item
instance of: scholarly article
zbMATH Open document ID: 1305.60064
author: Mirko Ebbers
author: Holger Knöpfel
author: Franck Vermet
author: M. Löwe
publication date: 2014-08-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/1206.4162
Mathematics Subject Classification ID: 60J22
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 82B80
Mathematics Subject Classification ID: 82B26
zbMATH DE Number: 6334116
zbMATH Keywords: Markov chain Monte Carlo (MCMC) methods
zbMATH Keywords: Blume-Emery-Griffiths model
zbMATH Keywords: statistical mechanics
zbMATH Keywords: phase transitions
zbMATH Keywords: swapping algorithm
zbMATH Keywords: simulated tempering
zbMATH Keywords: Metropolis algorithm
MaRDI profile type: Publication
OpenAlex ID: W2171944143
arXiv ID: 1206.4162
cites work: Multiple critical behavior of probabilistic limit theorems in the neighborhood of a tricritical point
cites work: Comparison theorems for reversible Markov chains
cites work: Logarithmic Sobolev inequalities for finite Markov chains
cites work: Geometric bounds for eigenvalues of Markov chains
cites work: Q3632266
cites work: Asymptotic behavior of the magnetization near critical and tricritical points via Ginzburg-Landau polynomials
cites work: Asymptotic behavior of the finite-size magnetization as a function of the speed of approach to criticality
cites work: Analysis of phase transitions in the mean-field Blume-Emery-Griffiths model
cites work: Large deviation principles and complete equivalence and nonequivalence results for pure and mixed ensembles
cites work: Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
cites work: The Swendsen-Wang process does not always mix rapidly
cites work: Mixing times for the mean-field Blume-Capel model via aggregate path coupling
cites work: The swapping algorithm for the Hopfield model with two patterns
cites work: Importance sampling for families of distributions
cites work: On the swapping algorithm
cites work: Q3135094
cites work: Approximate counting, uniform generation and rapidly mixing Markov chains
cites work: Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
cites work: Sufficient conditions for torpid mixing of parallel and simulated tempering
cites work: On swapping and simulated tempering algorithms.
DOI: 10.1002/RSA.20461
published in: Random Structures \& Algorithms
title: Mixing times for the swapping algorithm on the Blume-Emery-Griffiths model
description: scientific article; zbMATH DE number 6334116