Convergent sequences of sparse graphs: A large deviations approach

Random Structures and Algorithms

Volumn 51, Issue 1, 2017, Pages 52-89

  Borgs, Christian ^a   Chayes, Jennifer ^a   Gamarnik, David ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

combinatorial optimization; graph convergence; sparse graphs; statistical physics

Indexed keywords

EID: 85006100222     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20694     Document Type: Article

References (34)

1. E. Abbe and A. Montanari, On the concentration of the number of solutions of random satisfiability formulas, Random Struct Algorithms 45 (2014), 362–382.
2. M. Abért and T. Hubai, Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs, Combinatorica 35 (2015), 127–151.
3. D. Aldous and R. Lyons, Processes on unimodular random networks, Electron J Probab 12 (2007), 1454–1508.
4. D. Aldous and J. M. Steele, The objective method: Probabilistic combinatorial optimization and local weak convergence, In H. Kesten, editor, Probability on Discrete Structures, Springer Berlin Heidelberg, 2004, pp. 1–72.
5. O. Angel and O. Schramm, Uniform infinite planar triangulations, Commun Math Phys 241 (2003), 191–213.
6. M. Bayati, D. Gamarnik, and P. Tetali, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs, Ann Probab 41 (2013), 4080–4115.
7. I. Benjamini, Random planar metrics, In Proceedings of the International Congress of Mathematicians, World Scientific Publishing Company, Vol. 4, 2010, pp. 2177–2187.
8. I. Benjamini and O. Schramm, Recurrence of distributional limits of finite planar graphs, Electron J Probab 23 (2001), 1–13.
9. A. Bertoni, P. Campadelli, and R. Posenato, An upper bound for the maximum cut mean value, Graph-theoretic concepts in computer science, Lecture notes in computer science, Vol. 1335, Springer, Berlin, 1997, pp. 78–84.
10. P. Billingsley, Convergence of probability measures, 2nd edition, John Wiley & Sons, 1999.
11. B. Bollobás and O. Riordan, Sparse graphs: Metrics and random models, Random Struct Algorithms 39 (2011), 1–38.
12. C. Borgs, J. T. Chayes, J. Kahn, and L. Lovász, Left and right convergence of graphs with bounded degree, Random Struct Algorithms 42 (2013), 1–28.
13. C. Borgs, J. Chayes, and L. Lovász, Moments of two-variable functions and the uniqueness of graph limits, Geom Funct Analysis 19 (2010), 1597–1619.
14. C. Borgs, J. T. Chayes, L. Lovász, V. Sos, and K. Vesztergombi, Counting graph homomorphisms, In M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas, P. Valtr editors, Topics in discrete mathematics, Springer, 2006, pp. 315–371.
15. C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi, Convergent graph sequences II: Multiway cuts and statistical physics, Ann Math 176 (2012), 151–219.
16. C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi, Convergent graph sequences I: Subgraph frequencies, metric properties, and testing, Adv Math 219, 1801–1851.
17. S. Chatterjee and S. R. S. Varadhan, The large deviation principle for the Erdös-Rényi random graph, Eur J Combin 32 (2011), 1000–1017.
18. A. Dembo and A. Montanari, Ising models on locally tree-like graphs, Ann Appl Probab 20 (2010), 565–592.
19. A. Dembo, A. Montanari, and N. Sun, Factor models on locally tree-like graphs, Ann Probab 41 (2013), 4162–4213.
20. A. Dembo and O. Zeitouni, Large deviations techniques and applications, Vol. 38, Springer Science & Business Media, 2009.
21. P. Diaconis and S. Janson, Graph limits and exchangeable random graphs, Arxiv preprint arXiv:0712.2749, 2007.
22. J. Dugundji, Topology, Reprinting of the 1966 original, 1978.
23. S. Franz and M. Leone, Replica bounds for optimization problems and diluted spin systems, J Stati Phys 111 (2003), 535–564.
24. D. Gamarnik, Right-convergence of sparse random graphs, Preprint at http://arxiv.org/abs/1202.3123.
25. H. O. Georgii, Gibbs measures and phase transitions, Vol. 9, Walter de Gruyter, 2011.
26. F. Guerra and F. L. Toninelli, The thermodynamic limit in mean field spin glass models, Commun Math Phys 230 (2002), 71–79.
27. H. Hatami, L. Lovász, and B. Szegedy, Limits of local-global convergent graph sequences, Preprint at http://arxiv.org/abs/1205.4356, 2012.
28. M. O Jackson, Social and economic networks, Vol. 3, Princeton University Press, Princeton, 2008.
29. L. Lovász and B. Szegedy, Limits of dense graph sequences, J Combin Theory Ser B 96 (2006), 933–957.
30. M. Mezard and A. Montanari, Information, physics and computation, Oxford graduate texts, 2009.
31. D. Panchenko and M. Talagrand, Bounds for diluted mean-fields spin glass models, Probab Theory Relat Fields 130 (2004), 312–336.
32. B. Simon, The statistical mechanics of lattice gases, Vol. 1, Princeton University Press, 2014.
33. S. H. Strogatz, Exploring complex networks, Nature 410 (2001), 268–276.
34. D. Watts and S. Strogatz, Collective dynamics of small-world networks, Nature 393 (1998).