Resumen de Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
Mohsen Bayati, David Gamarnik, Prasad Tetali
We establish the existence of free energy limits for several combinatorial models on Erdös–Rényi graph G(N,⌊cN⌋) and random r-regular graph G(N,r). For a variety of models, including independent sets, MAX-CUT, coloring and K-SAT, we prove that the free energy both at a positive and zero temperature, appropriately rescaled, converges to a limit as the size of the underlying graph diverges to infinity. In the zero temperature case, this is interpreted as the existence of the scaling limit for the corresponding combinatorial optimization problem. For example, as a special case we prove that the size of a largest independent set in these graphs, normalized by the number of nodes converges to a limit w.h.p. This resolves an open problem which was proposed by Aldous (Some open problems) as one of his six favorite open problems. It was also mentioned as an open problem in several other places: Conjecture 2.20 in Wormald [In Surveys in Combinatorics, 1999 (Canterbury) (1999) 239–298 Cambridge Univ. Press]; Bollobás and Riordan [Random Structures Algorithms 39 (2011) 1–38]; Janson and Thomason [Combin. Probab. Comput. 17 (2008) 259–264] and Aldous and Steele [In Probability on Discrete Structures (2004) 1–72 Springer].
Our approach is based on extending and simplifying the interpolation method of Guerra and Toninelli [Comm. Math. Phys. 230 (2002) 71–79] and Franz and Leone [J. Stat. Phys. 111 (2003) 535–564]. Among other applications, this method was used to prove the existence of free energy limits for Viana–Bray and K-SAT models on Erdös–Rényi graphs. The case of zero temperature was treated by taking limits of positive temperature models. We provide instead a simpler combinatorial approach and work with the zero temperature case (optimization) directly both in the case of Erdös–Rényi graph G(N,⌊cN⌋) and random regular graph G(N,r). In addition we establish the large deviations principle for the satisfiability property of the constraint satisfaction problems, coloring, K-SAT and NAE-K-SAT, for the G(N,⌊cN⌋) random graph model.
