On the Potts antiferromagnet on random graphs

zbMath1351.05203arXiv1603.00081MaRDI QIDQ727170

Nor Jaafari, Amin Coja-Oghlan

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsPotts model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Critical phenomena in equilibrium statistical mechanics (82B27)

Related Items (8)

Random Instances of Problems in NP – Algorithms and Statistical Physics ⋮ Information-theoretic thresholds from the cavity method ⋮ Continuous spin models on annealed generalized random graphs ⋮ Bethe states of random factor graphs ⋮ Charting the replica symmetric phase ⋮ Sidorenko's conjecture, colorings and independent sets ⋮ Charting the replica symmetric phase ⋮ The replica symmetric phase of random constraint satisfaction problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decay of correlations for the hardcore model on the \(d\)-regular random graph
• A positive temperature phase transition in random hypergraph 2-coloring
• Antiferromagnetic Potts model on the Erdős-Rényi random graph
• Upper-bounding the \(k\)-colorability threshold by counting covers
• Reconstruction on trees and spin glass transition
• On the chromatic number of random regular graphs
• On the chromatic number of random \(d\)-regular graphs
• On the chromatic number of a random hypergraph
• The replica symmetric solution for Potts models on \(d\)-regular graphs
• Switching Colouring of G(n,d/n) for Sampling up to Gibbs Uniqueness Threshold
• Information, Physics, and Computation
• The Chromatic Number of Random Graphs for Most Average Degrees
• The condensation phase transition in the regular $k$-SAT model
• Hypergraph coloring up to condensation
• MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold
• Gibbs states and the set of solutions of random constraint satisfaction problems
• The freezing threshold for k-colourings of a random graph
• The two possible values of the chromatic number of a random graph
• The condensation phase transition in random graph coloring

This page was built for publication: On the Potts antiferromagnet on random graphs