Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model

DOI10.1002/rsa.20461zbMath1305.60064arXiv1206.4162OpenAlexW2171944143MaRDI QIDQ2877769

Holger Knöpfel, Franck Vermet, Mirko Ebbers, Matthias Loewe

Publication date: 25 August 2014

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.4162

zbMATH Keywords

phase transitionsstatistical mechanicsMetropolis algorithmMarkov chain Monte Carlo (MCMC) methodssimulated temperingswapping algorithmBlume-Emery-Griffiths model

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Phase transitions (general) in equilibrium statistical mechanics (82B26)

Related Items

Equi-energy sampling does not converge rapidly on the mean-field Potts model with three colors close to the critical temperature ⋮ Glauber dynamics of 2D Kac-Blume-Capel model and their stochastic PDE limits ⋮ Spectral gap of replica exchange Langevin diffusion on mixture distributions ⋮ Some remarks on replicated simulated annealing ⋮ Rapid mixing of Glauber dynamics of Gibbs ensembles via aggregate path coupling and large deviations methods

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic behavior of the finite-size magnetization as a function of the speed of approach to criticality
• Mixing times for the mean-field Blume-Capel model via aggregate path coupling
• The swapping algorithm for the Hopfield model with two patterns
• Geometric bounds for eigenvalues of Markov chains
• Asymptotic behavior of the magnetization near critical and tricritical points via Ginzburg-Landau polynomials
• Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
• Sufficient conditions for torpid mixing of parallel and simulated tempering
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Comparison theorems for reversible Markov chains
• Importance sampling for families of distributions
• The Swendsen-Wang process does not always mix rapidly
• Multiple critical behavior of probabilistic limit theorems in the neighborhood of a tricritical point
• Logarithmic Sobolev inequalities for finite Markov chains
• Analysis of phase transitions in the mean-field Blume-Emery-Griffiths model
• On swapping and simulated tempering algorithms.
• On the swapping algorithm
• Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
• Large deviation principles and complete equivalence and nonequivalence results for pure and mixed ensembles

This page was built for publication: Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model