Uniqueness for the 3-state antiferromagnetic Potts model on the tree
DOI10.1214/18-EJP211zbMATH Open1398.05086arXiv1804.03514OpenAlexW2963830217MaRDI QIDQ1990212FDOQ1990212
Authors: Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
Publication date: 25 October 2018
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.03514
Recommendations
- Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree
- Reconstruction for the Potts model
- Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- On the uniqueness of Gibbs measure in the Potts model on a Cayley tree with external field
Trees (05C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Coloring of graphs and hypergraphs (05C15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Cites Work
- Gibbs measures and phase transitions.
- Gibbs measures on Cayley trees
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Prescribing a System of Random Variables by Conditional Distributions
- Correlation decay up to uniqueness in spin systems
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- Approach to equilibrium of Glauber dynamics in the one phase region. II: The general case
- Bound on the mass gap for finite volume stochastic Ising models at low temperature
- Counting in two-spin models on \(d\)-regular graphs
- Combinatorial criteria for uniqueness of Gibbs measures
- Uniqueness of uniform random colorings of regular trees
- Correlation decay and deterministic FPTAS for counting colorings of a graph
- Title not available (Why is that?)
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Rapid mixing of Gibbs sampling on graphs that are sparse on average
- Statistical mechanics of lattice systems. A concrete mathematical introduction
- Spatial mixing and the connective constant: optimal bounds
- An FPTAS for counting proper four-colorings on cubic graphs
- Sampling random colorings of sparse random graphs
- A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold
Cited In (6)
- Title not available (Why is that?)
- Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
- Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \)
- Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree
- Uniqueness and non-uniqueness for spin-glass ground states on trees
- Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
This page was built for publication: Uniqueness for the 3-state antiferromagnetic Potts model on the tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990212)