论文信息 - Singularities in the Entropy of Asymptotically Large Simple Graphs

Singularities in the Entropy of Asymptotically Large Simple Graphs

We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve. We also determine the precise modified-bipartite structure of asymptotic graphs with edge density 1/2 and triangle density in the interval $$\displaystyle [0,1/8]$$[0,1/8].

Charles Radin | Lorenzo Sadun | C. Radin | L. Sadun

[1] M. Bálek,et al. Large Networks and Graph Limits , 2022 .

[2] C. Borgs,et al. Moments of Two-Variable Functions and the Uniqueness of Graph Limits , 2008, 0803.1244.

[3] P. Diaconis,et al. Estimating and understanding exponential random graph models , 2011, 1102.2650.

[4] Alexander A. Razborov,et al. Asymptotic Structure of Graphs with the Minimum Number of Triangles , 2017, Comb. Probab. Comput..

[5] B. Szegedy,et al. Szemerédi’s Lemma for the Analyst , 2007 .

[6] Mei Yin,et al. Phase transitions in exponential random graphs , 2011, 1108.0649.

[7] Charles Radin,et al. Emergent Structures in Large Networks , 2013, J. Appl. Probab..

[8] Mark Newman,et al. Networks: An Introduction , 2010 .

[9] Sourav Chatterjee,et al. The large deviation principle for the Erdős-Rényi random graph , 2011, Eur. J. Comb..

[10] V. Sós,et al. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[11] Charles Radin,et al. Phase transitions in a complex network , 2013, 1301.1256.

[12] László Lovász,et al. Limits of dense graph sequences , 2004, J. Comb. Theory B.

[13] László Lovász,et al. Finitely forcible graphons , 2009, J. Comb. Theory, Ser. B.

[14] A. Shapira,et al. Extremal Graph Theory , 2013 .

[15] R. A. R. A Z B O R O V. On the minimal density of triangles in graphs , 2008 .