Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

We establish the existence of free energy limits for several combinatorial models on Erd\"{o}s-R\'{e}nyi graph $\mathbb {G}(N,\lfloor cN\rfloor)$ and random $r$-regular graph $\mathbb {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\'{a}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].

[1]  David Gamarnik,et al.  Random MAX SAT, random MAX CUT, and their phase transitions , 2003 .

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  A. Dembo,et al.  Gibbs Measures and Phase Transitions on Sparse Random Graphs , 2009, 0910.5460.

[4]  David Gamarnik.  Linear phase transition in random linear constraint satisfaction problems , 2004, SODA '04.

[5]  Michele Leone,et al.  Replica Bounds for Optimization Problems and Diluted Spin Systems , 2002 .

[6]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

[7]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[8]  A. Dembo,et al.  Ising models on locally tree-like graphs , 2008, 0804.4726.

[9]  Paul Erdös,et al.  Some Linear and Some Quadratic Recursion Formulas. I , 1951 .

[10]  Béla Bollobás,et al.  Sparse graphs: Metrics and random models , 2008, Random Struct. Algorithms.

[11]  D. Gamarnik,et al.  Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method , 2006 .

[12]  N. Wormald,et al.  Models of the , 2010 .

[13]  Svante Janson,et al.  Dismantling Sparse Random Graphs , 2007, Combinatorics, Probability and Computing.

[14]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[15]  Andrea Montanari,et al.  Tight bounds for LDPC and LDGM codes under MAP decoding , 2004, IEEE Transactions on Information Theory.

[16]  J. Michael Steele,et al.  The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence , 2004 .

[17]  M. Talagrand,et al.  Bounds for diluted mean-fields spin glass models , 2004, math/0405357.

[18]  F. Guerra,et al.  The Thermodynamic Limit in Mean Field Spin Glass Models , 2002, cond-mat/0204280.

[19]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[20]  Mohammad Taghi Hajiaghayi,et al.  Random MAX SAT, random MAX CUT, and their phase transitions , 2003, SODA '03.