On the Potts antiferromagnet on random graphs
zbMATH Open1351.05203arXiv1603.00081MaRDI QIDQ727170FDOQ727170
Authors: Amin Coja-Oghlan, Nor Jaafari
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Antiferromagnetic Potts model on the Erdős-Rényi random graph
- Potts model on random trees
- The replica symmetric solution for Potts models on \(d\)-regular graphs
- Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
- Potts model on infinite graphs and the limit of chromatic polynomials
Random graphs (graph-theoretic aspects) (05C80) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Phase transitions (general) in equilibrium statistical mechanics (82B26) Critical phenomena in equilibrium statistical mechanics (82B27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The two possible values of the chromatic number of a random graph
- Decay of correlations for the hardcore model on the \(d\)-regular random graph
- Gibbs states and the set of solutions of random constraint satisfaction problems
- A positive temperature phase transition in random hypergraph 2-coloring
- Information, Physics, and Computation
- Antiferromagnetic Potts model on the Erdős-Rényi random graph
- The condensation phase transition in random graph coloring
- Title not available (Why is that?)
- The freezing threshold for \(k\)-colourings of a random graph
- Upper-bounding the \(k\)-colorability threshold by counting covers
- Reconstruction on trees and spin glass transition
- On the chromatic number of a random hypergraph
- Switching colouring of \(G(n,d/n)\) for sampling up to Gibbs uniqueness threshold
- On the chromatic number of random \(d\)-regular graphs
- The replica symmetric solution for Potts models on \(d\)-regular graphs
- 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
- On the chromatic number of random regular graphs
Cited In (18)
- On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
- Percolation on the average and spontaneous magnetization forq-states Potts model on graph
- Continuous spin models on annealed generalized random graphs
- Bethe states of random factor graphs
- Potts model on random trees
- Non-self-averaging in autocorrelations for Potts models on quenched random gravity graphs
- Charting the replica symmetric phase
- Title not available (Why is that?)
- The replica symmetric phase of random constraint satisfaction problems
- Universality of the mean-field for the Potts model
- Charting the replica symmetric phase
- Extremes of the internal energy of the Potts model on cubic graphs
- Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
- Antiferromagnetic Potts model on the Erdős-Rényi random graph
- The replica symmetric solution for Potts models on \(d\)-regular graphs
- Random-fieldp-spin-glass model on regular random graphs
- Random instances of problems in NP -- algorithms and statistical physics
- Sidorenko's conjecture, colorings and independent sets
This page was built for publication: On the Potts antiferromagnet on random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727170)