properties, and testing, [ Adv. Math.]{} [ 219]{} (2008) 1801-1851.

H.B. Callen, [Thermodynamics]{}, John Wiley, New York, 1960.

S. Chatterjee, and P. Diaconis, Estimating and understanding exponential random graph models, arXiv: 1102.2650v3.

S. Chatterjee and S.R.S. Varadhan, The large deviation principle for the Erdős-Rényi random graph, Eur. J. Comb. 32 (2011) 1000-1017

T.C. Dorlas, Statistical Mechanics: Fundamentals and Model Solutions, Institute of Physics Publishing, London, 1999.

H-O. Georgii, The equivalence of ensembles for classical systems of particles, J. Stat. Phys. 80 (1995) 1341-1378.

L. Lovász, Large networks and graph limits, American Mathematical Society, Providence, 2012.

, Limits of dense graph sequences, [ J. Combin. Theory Ser. B]{} [ 96]{} (2006) 933-957.

, Szemerédi’s lemma for the analyst, [ GAFA]{} [ 17]{} (2007) 252-270.

, Finitely forcible graphons, [ J. Combin. Theory Ser. B]{} [101]{} (2011) 269-301.

S.-K. Ma, [Statistical Mechanics]{}, World Scientific, Singapore, 1985.

M.E.J. Newman, Networks: an Introduction, Oxford University Press, 2010.

J. Park and M.E.J. Newman, Solution for the properties of a clustered network, Phys. Rev. E 72 (2005) 026136.

O. Pikhurko and A. Razborov, Asymptotic structure of graphs with the minimum number of triangles, arXiv:1203.4393

D. Ruelle, [*Statistical Mechanics; Rigorous Results*]{}, Benjamin, New York, 1969.

D. Ruelle, 