Mixing of the Glauber dynamics for the ferromagnetic Potts model

DOI10.1002/rsa.20569zbMath1332.60132arXiv1305.0776OpenAlexW2962813956MaRDI QIDQ3467578

Viresh Patel, Catherine Greenhill, Magnus Bordewich

Publication date: 3 February 2016

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

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

zbMATH Keywords

Glauber dynamicsmixing timeferromagnetic Potts model

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic methods (Fokker-Planck, Langevin, etc.) applied to problems in time-dependent statistical mechanics (82C31)

Related Items (13)

Fast algorithms at low temperatures via Markov chains† ⋮ The Swendsen–Wang dynamics on trees ⋮ Sampling from the low temperature Potts model through a Markov chain on flows ⋮ Spatial mixing and the random‐cluster dynamics on lattices ⋮ Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs ⋮ Metastability of the Potts ferromagnet on random regular graphs ⋮ Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics ⋮ Unnamed Item ⋮ Tunneling behavior of Ising and Potts models in the low-temperature regime ⋮ Random-cluster dynamics on random regular graphs in tree uniqueness ⋮ Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs ⋮ Large deviations, a phase transition, and logarithmic Sobolev inequalities in the block spin Potts model ⋮ On mixing of Markov chains: coupling, spectral independence, and entropy factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inapproximability of the Tutte polynomial
• Markov chain comparison
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A generalization of Hölder's inequality and some probability inequalities
• Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
• Comparison theorems for reversible Markov chains
• The relative complexity of approximate counting problems
• The random-cluster model on a homogeneous tree
• Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
• Structure and eigenvalues of heat-bath Markov chains
• Analyzing Glauber dynamics by comparison of Markov chains
• Polynomial-Time Approximation Algorithms for the Ising Model
• Approximating the Permanent
• Approximating the Partition Function of the Ferromagnetic Potts Model
• A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
• A more rapidly mixing Markov chain for graph colorings
• On the computational complexity of the Jones and Tutte polynomials
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
• Rapid mixing of Swendsen–Wang dynamics in two dimensions
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Mixing of the Glauber dynamics for the ferromagnetic Potts model