Journal of Applied Probability

Emergent structures in large networks

David Aristoff and Charles Radin

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We consider a large class of exponential random graph models and prove the existence of a region of parameter space corresponding to the emergent multipartite structure, separated by a phase transition from a region of disordered graphs. An essential feature is the formalism of graph limits as developed by Lovász et al. for dense random graphs.

Article information

J. Appl. Probab., Volume 50, Number 3 (2013), 883-888.

First available in Project Euclid: 5 September 2013

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60B99: None of the above, but in this section
Secondary: 05C35: Extremal problems [See also 90C35]

Exponential random graph model complex network phase transition


Aristoff, David; Radin, Charles. Emergent structures in large networks. J. Appl. Probab. 50 (2013), no. 3, 883--888. doi:10.1239/jap/1378401243.

Export citation


  • Borgs, C. \et (2008). Convergent graph sequences I: subgraph frequencies, metric properties, and testing. Adv. Math. 219, 1801–1851.
  • Chatterjee, S. and Diaconis, P. (2011). Estimating and understanding exponential random graph models. Preprint. Available at
  • Chatterjee, S. and Varadhan, S. R. S. (2011). The large deviation principle for the Erdős-Rényi random graph. Europ. J. Combinatorics 32, 1000–1017.
  • Fienberg, S. E. (2010). Introduction to papers on the modeling and analysis of network data. Ann. Appl. Statist. 4, 1–4.
  • Fienberg, S. E. (2010). Introduction to papers on the modeling and analysis of network data–-II. Ann. Appl. Statist. 4, 533–534.
  • Fisher, M. E. and Radin, C. (2006). Definitions of thermodynamic phases and phase transitions. 2006 Workshop Rep. Available at
  • Kadanoff, L. P. (2011). Theories of matter: infinities and renormalization. In The Oxford Handbook of the Philosophy of Physics, ed. R. Batterman, Oxford University Press.
  • Krantz, S. G. and Parks, H. R. (2002). A Primer of Real Analytic Functions, 2nd edn. Birkhäuser, Boston, MA.
  • Lovász, L. (2009). Very large graphs. Current Develop. Math. 2008, 67–128.
  • Lovász, L. and Szegedy, B. (2006). Limits of dense graph sequences. J. Combinatorial Theory B 96, 933–957.
  • Lovász, L. and Szegedy, B. (2007). Szemerédi's lemma for the analyst. Geom. Funct. Anal. 17, 252–270.
  • Newman, M. E. J. (2010). Networks: An Introduction. Oxford University Press, Oxford.
  • Robins, G., Pattison, P., Kalish, Y. and Lushern, D. (2007). An introduction to exponential random graph ($p^\ast$) models for social networks. Social Networks 29, 173–191.
  • Ruelle, D. (1969). Statistical Mechanics: Rigorous Results. World Scientific, River Edge, NJ.
  • Radin, C. and Yin, M. (2013). Phase transitions in exponential random graphs. To appear in Ann. Appl. Prob.
  • Turán, P. (1941). On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436–452 (in Hungarian).
  • Yeoman, J. M. (1992). Statistical Mechanics of Phase Transitions. Clarendon Press, Oxford.