Abstract
We study the asymptotics of large, simple, labeled graphs constrained by the densities of two subgraphs. It was recently conjectured that for all feasible values of the densities most such graphs have a simple structure. Here we prove this in the special case where the densities are those of edges and of k-star subgraphs, \(k\ge 2\) fixed. We prove that under such constraints graphs are “multipodal”: asymptotically in the number of vertices there is a partition of the vertices into \(M < \infty \) subsets \(V_1, V_2, \ldots , V_M\), and a set of well-defined probabilities \(g_{ij}\) of an edge between any \(v_i \in V_i\) and \(v_j \in V_j\). For \(2\le k\le 30\) we determine the phase space: the combinations of edge and k-star densities achievable asymptotically. For these models there are special points on the boundary of the phase space with nonunique asymptotic (graphon) structure; for the 2-star model we prove that the nonuniqueness extends to entropy maximizers in the interior of the phase space.
Similar content being viewed by others
References
Ahlswede, R., Katona, G.O.H.: Graphs with maximal number of adjacent pairs of edges. Acta Math. Acad. Sci. Hung. 32, 97–120 (1978)
Aristoff, D., Radin, C.: First order phase transition in a model of quasicrystals. J. Phys. A: Math. Theor. 44, 255001 (2011)
Aristoff, D., Radin, C.: Emergent structures in large networks. J. Appl. Probab. 50, 883–888 (2013)
Aristoff, D., Zhu, L.: On the phase transition curve in a directed exponential random graph model. arxiv:1404.6514
Bollobas, B.: Extremal Graph Theory. Dover Publications, New York (2004)
Borgs, C., Chayes, J., Lovász, L., Sós, V.T., Vesztergombi, K.: Convergent graph sequences I: subgraph frequencies, metric properties, and testing. Adv. Math. 219, 1801–1851 (2008)
Borgs, C., Chayes, J., Lovász, L.: Moments of two-variable functions and the uniqueness of graph limits. Geom. Funct. Anal. 19, 1597–1619 (2010)
Chatterjee, S., Diaconis, P.: Estimating and understanding exponential random graph models. Ann. Stat. 41, 2428–2461 (2013)
Chatterjee, S., Varadhan, S.R.S.: The large deviation principle for the Erdős–Rényi random graph. Eur. J. Comb. 32, 1000–1017 (2011)
Chatterjee, S., Diaconis, P., Sly, A.: Random graphs with a given degree sequence. Ann. Appl. Probab. 21, 1400–1435 (2011)
Fejes Tóth, L.: Regular Figures. Macmillan, New York (1964)
Janot, C.: Quasicrystals: A Primer. Oxford University Press, Oxford (1997)
Kenyon, R., Radin, C., Ren, K., Sadun, L.: Bipodal structure in oversaturated random graphs. Int. Math. Res. Notices (2016). doi:10.1093/imrn/rnw261
Lovász, L.: Large Networks and Graph Limits. American Mathematical Society, Providence (2012)
Lovász, L., Szegedy, B.: Limits of dense graph sequences. J. Combin. Theory Ser. B 98, 933–957 (2006)
Lovász, L., Szegedy, B.: Szemerédi’s lemma for the analyst. GAFA 17, 252–270 (2007)
Lovász, L., Szegedy, B.: Finitely forcible graphons. J. Combin. Theory Ser. B 101, 269–301 (2011)
Löwen, H.: Fun with hard spheres, In: Mecke, K., Stoyan, D. (eds.) Spatial Statistics and Statistical Physics. Lecture Notes in Physics, vol. 554, pp. 295–331. Springer, Berlin (2000)
Lubetzky, E., Zhao, Y.: On replica symmetry of large deviations in random graphs. Random Struct. Algorithms 47, 109–146 (2015)
Newman, M.F.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Radin, C.: Miles of Tiles, Student Mathematical Library, vol. 1. American Mathematical Society, Providence (1999)
Radin, C., Sadun, L.: Phase transitions in a complex network. J. Phys. A: Math. Theor. 46, 305002 (2013)
Radin, C., Sadun, L.: Singularities in the entropy of asymptotically large simple graphs. J. Stat. Phys. 158, 853–865 (2015)
Radin, C., Yin, M.: Phase transitions in exponential random graphs. Ann. Appl. Probab. 23, 2458–2471 (2013)
Radin, C., Ren, K., Sadun, L.: The asymptotics of large constrained graphs. J. Phys. A: Math. Theor. 47, 175001 (2014)
Reiher, C.: The clique density theorem. Ann. Math. 184, 683–707 (2016)
Ruelle, D.: Statistical Mechanics: Rigorous Results. Benjamin, New York (1969)
Senechal, M.: Quasicrystals and Geometry. Cambridge University Press, Cambridge (1995)
Touchette, H., Ellis, R.S., Turkington, B.: Physica A 340, 138–146 (2004)
Yin, M.: Critical phenomena in exponential random graphs. J. Stat. Phys. 153, 1008–1021 (2013)
Yin, M., Rinaldo, A., Fadnavis, S.: Asymptotic quantization of exponential random graphs. Ann. Appl. Probab. 26, 3251–3285 (2016)
Acknowledgements
The authors gratefully acknowledge useful discussions with Mei Yin and references from Miki Simonovits, Oleg Pikhurko and Daniel Král’. The computational codes involved in this research were developed and debugged on the computational cluster of the Mathematics Department of UT Austin. The main computational results were obtained on the computational facilities in the Texas Super Computing Center (TACC). We gratefully acknowledge this computational support. R. Kenyon was partially supported by the Simons Foundation. This work was also partially supported by NSF Grants DMS-1208191, DMS-1208941, DMS-1321018 and DMS-1101326.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kenyon, R., Radin, C., Ren, K. et al. Multipodal Structure and Phase Transitions in Large Constrained Graphs. J Stat Phys 168, 233–258 (2017). https://doi.org/10.1007/s10955-017-1804-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-017-1804-0