On the Potts Antiferromagnet on Random Graphs

  title={On the Potts Antiferromagnet on Random Graphs},
  author={Amin Coja-Oghlan and Nor Jaafari},
  journal={Electron. J. Comb.},
Extending a prior result of Contucci et al (Comm. Math. Phys. 2013), we determine the free energy of the Potts antiferromagnet on the Erdos-Renyi random graph at all temperatures for average degrees $d \le (2k-1)\ln k - 2 - k^{-1/2}$. In particular, we show that for this regime of $d$ there does not occur a phase transition. 
Charting the Replica Symmetric Phase
This paper rigorises the picture completely for a broad class of models, encompassing the Potts antiferromagnet on the random graph, the k-XORSAT model and the diluted k-spin model for even k and proves a conjecture about the detection problem in the stochastic block model. Expand
Bethe States of Random Factor Graphs
We verify a key component of the replica symmetry breaking hypothesis put forward in the physics literature (Mézard and Montanari in Information, physics and computation. Oxford University Press,Expand
Information-theoretic thresholds from the cavity method
A formula for the mutual information in statistical inference problems induced by random graphs is established and it is shown that the Mutual information holds the key to understanding certain important phase transitions in random graph models. Expand
Continuous spin models on annealed generalized random graphs
Abstract We study Gibbs distributions of spins taking values in a general compact Polish space, interacting via a pair potential along the edges of a generalized random graph with a given asymptoticExpand
The replica symmetric phase of random constraint satisfaction problems
This paper proves physics predictions on the precise location and nature of phase transitions in random constraint satisfaction problems that predicted that their satisfiability thresholds are quite generally preceded by several other thresholds that have a substantial impact both combinatorially and computationally. Expand
Sidorenko's Conjecture, Colorings and Independent Sets
This paper proves Sidorenko's conjecture for certain special graphs G, which states that in the last two cases (independent sets and Widom-Rowlinson colorings) the graph $H$ does not need to be bipartite. Expand


Antiferromagnetic Potts Model on the Erdős-Rényi Random Graph
We study the antiferromagnetic Potts model on the Poissonian Erdős-Rényi random graph. By identifying a suitable interpolation structure and an extended variational principle, together with aExpand
The Condensation Phase Transition in Random Graph Coloring
Based on a non-rigorous formalism called the “cavity method”, physicists have put forward intriguing predictions on phase transitions in diluted mean-field models, in which the geometry ofExpand
A positive temperature phase transition in random hypergraph 2-coloring
This paper establishes the existence and asymptotic location of this so-called condensation phase transition in the random hypergraph $2$-coloring problem. Expand
Potts glass on random graphs
We solve the q-state Potts model with anti-ferromagnetic interactions on large random lattices of finite coordination. Due to the frustration induced by the large loops and to the local tree-likeExpand
The Replica Symmetric Solution for Potts Models on d-Regular Graphs
We establish an explicit formula for the limiting free energy density (log-partition function divided by the number of vertices) for ferromagnetic Potts models on uniformly sparse graph sequencesExpand
Decay of Correlations for the Hardcore Model on the $d$-regular Random Graph
A key insight from statistical physics about spin systems on random graphs is the central role played by Gibbs measures on trees. We determine the local weak limit of the hardcore model on randomExpand
MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold
This work focuses on the k-colouring model} and the hard-core model with fugacity \lambda when the underlying graph is an instance of Erdos-Renyi random graph G(n,p), where p=d/n and d is fixed and uses the Markov Chain Monte Carlo method for sampling from Gibbs distribution. Expand
Reconstruction on Trees and Spin Glass Transition
Consider an information source generating a symbol at the root of a tree network whose links correspond to noisy communication channels, and broadcasting it through the network. We study the problemExpand
On the chromatic number of random d-regular graphs
In this work we show that, for any fixed d, random d-regular graphs asymptotically almost surely can be coloured with k colours, where k is the smallest integer satisfying d (2k−3)log(k−1), then theExpand
On the chromatic number of a random hypergraph
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, where k, r, c remain constant as n ? ∞ . Achlioptas and Naor showed that the chromatic number of aExpand