Papers
Topics
Authors
Recent
Search
2000 character limit reached

Annealed Potts models on rank-1 inhomogeneous random graphs

Published 14 Feb 2025 in math.PR, math-ph, and math.MP | (2502.10553v1)

Abstract: In this paper, we study the annealed ferromagnetic $q$-state Potts model on sparse rank-1 random graphs, where vertices are equipped with a vertex weight, and the probability of an edge is proportional to the product of the vertex weights. In an annealed system, we take the average on both numerator and denominator of the ratio defining the Boltzmann-Gibbs measure of the Potts model. We show that the thermodynamic limit of the pressure per particle exists for rather general vertex weights. In the infinite-variance weight case, we show that the critical temperature equals infinity. For finite-variance weights, we show that, under a rather general condition, the phase transition is {\em first order} for all $q\geq 3$. However, we cannot generally show that the discontinuity of the order parameter is {\em unique}. We prove this uniqueness under a reasonable condition that holds for various distributions, including uniform, gamma, log-normal, Rayleigh and Pareto distributions. Further, we show that the first-order phase transition {\em persists} even for some small positive external field. In the rather relevant case of Pareto distributions with power-law exponent $\tau$, remarkably, the phase transition is first order when $\tau\geq 4$, but not necessarily when the weights have an infinite third-moment, i.e., when $\tau\in(3,4)$. More precisely, the phase transition is second order for $\tau\in (3,\tau(q)]$, while it is first order when $\tau>\tau(q)$, where we give an explicit equation that $\tau(q)$ solves.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.