This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
D. Aristoff and C. Radin (2013) Emergent structures in large networks. J. Appl. Probab.
D. Aristoff and L. Zhu (2015) Asymptotic structure and singularities in constrained directed graphs. Stochastic Process. Appl.
C. Borgs , J. Chayes and L. Lovász (2010) Moments of two-variable functions and the uniqueness of graph limits. Geom. Funct. Anal.
C. Borgs , J. T. Chayes , L. Lovász , V. T. Sós and K. Vesztergombi (2008) Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Adv. Math.
C. Borgs , J. T. Chayes , L. Lovász , V. T. Sós and K. Vesztergombi (2012) Convergent sequences of dense graphs II: Multiway cuts and statistical physics. Ann. of Math. (2)
S. Chatterjee (2012) The missing log in large deviations for triangle counts. Random Struct. Alg.
S. Chatterjee and A. Dembo (2016) Nonlinear large deviations. Adv. Math.
S. Chatterjee and P. Diaconis (2013) Estimating and understanding exponential random graph models. Ann. Statist.
S. Chatterjee and S. R. S. Varadhan (2011) The large deviation principle for the Erdős–Rényi random graph. European J. Combin.
D. Conlon , J. Fox and B. Sudakov (2010) An approximate version of Sidorenko's conjecture. Geom. Funct. Anal.
B. DeMarco and J. Kahn (2012) Upper tails for triangles. Random Struct. Alg.
A. W. Goodman (1959
On sets of acquaintances and strangers at any party. Amer. Math. Monthly
H. Hatami (2010) Graph norms and Sidorenko's conjecture. Israel J. Math.
S. Janson (1990) Poisson approximation for large deviations. Random Struct. Alg.
S. Janson , T. Łuczak and A. Ruciński (2000) Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience.
S. Janson and L. Warnke (2016) The lower tail: Poisson approximation revisited. Random Struct. Alg.
J. Kim , C. Lee and J. Lee (2016) Two approaches to Sidorenko's conjecture. Trans. Amer. Math. Soc.
L. Lovász (2012) Large Networks and Graph Limits, Vol. 60 of American Mathematical Society Colloquium Publications, AMS.
L. Lovász and B. Szegedy (2006) Limits of dense graph sequences. J. Combin. Theory Ser. B
L. Lovász and B. Szegedy (2007) Szemerédi's lemma for the analyst. Geom. Funct. Anal.
E. Lubetzky and Y. Zhao (2015) On replica symmetry of large deviations in random graphs. Random Struct. Alg.
V. Nikiforov (2011) The number of cliques in graphs of given order and size. Trans. Amer. Math. Soc.
C. Radin , K. Ren and L. Sadun (2014) The asymptotics of large constrained graphs. J. Phys. A
C. Radin and L. Sadun (2013) Phase transitions in a complex network. J. Phys. A
C. Radin and L. Sadun (2015) Singularities in the entropy of asymptotically large simple graphs. J. Statist. Phys.
C. Radin and M. Yin (2013) Phase transitions in exponential random graphs. Ann. Appl. Probab.
A. A. Razborov (2008) On the minimal density of triangles in graphs. Combin. Probab. Comput.
A. Sidorenko (1993) A correlation inequality for bipartite graphs. Graphs Combin.
M. Yin (2013) Critical phenomena in exponential random graphs. J. Statist. Phys.
M. Yin (2015) Large deviations and exact asymptotics for constrained exponential random graphs. Electron. Commun. Probab.
20, 14 pp.
M. Yin and L. Zhu (2016) Reciprocity in directed networks. Phys. A