Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-24T16:49:55.253Z Has data issue: false hasContentIssue false

Emergent Structures in Large Networks

Published online by Cambridge University Press:  30 January 2018

David Aristoff*
Affiliation:
University of Minnesota
Charles Radin*
Affiliation:
The University of Texas at Austin
*
Postal address: Department of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA. Email address: [email protected]
∗∗ Postal address: Mathematics Department, The University of Texas at Austin, Austin, TX 78712-1202, USA. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Copyright
© Applied Probability Trust 

References

Borgs, C. et al. (2008). Convergent graph sequences I: subgraph frequencies, metric properties, and testing. Adv. Math. 219, 18011851.CrossRefGoogle Scholar
Chatterjee, S. and Diaconis, P. (2011). Estimating and understanding exponential random graph models. Preprint. Available at http://arxiv.org/abs/1102.2650v3.Google Scholar
Chatterjee, S. and Varadhan, S. R. S. (2011). The large deviation principle for the Erdős-Rényi random graph. Europ. J. Combinatorics 32, 10001017.CrossRefGoogle Scholar
Fienberg, S. E. (2010). Introduction to papers on the modeling and analysis of network data. Ann. Appl. Statist. 4, 14.Google Scholar
Fienberg, S. E. (2010). Introduction to papers on the modeling and analysis of network data—II. Ann. Appl. Statist. 4, 533534.Google Scholar
Fisher, M. E. and Radin, C. (2006). Definitions of thermodynamic phases and phase transitions. 2006 Workshop Rep. Available at http://www.aimath.org/WWN/phasetransition/Defs16.pdf.Google Scholar
Kadanoff, L. P. (2011). Theories of matter: infinities and renormalization. In The Oxford Handbook of the Philosophy of Physics, ed. Batterman, R., Oxford University Press.Google Scholar
Krantz, S. G. and Parks, H. R. (2002). A Primer of Real Analytic Functions, 2nd edn. Birkhäuser, Boston, MA.CrossRefGoogle Scholar
Lovász, L. (2009). Very large graphs. Current Develop. Math. 2008, 67128.CrossRefGoogle Scholar
Lovász, L. and Szegedy, B. (2006). Limits of dense graph sequences. J. Combinatorial Theory B 96, 933957.CrossRefGoogle Scholar
Lovász, L. and Szegedy, B. (2007). Szemerédi's lemma for the analyst. Geom. Funct. Anal. 17, 252270.CrossRefGoogle Scholar
Newman, M. E. J. (2010). Networks: An Introduction. Oxford University Press, Oxford.CrossRefGoogle Scholar
Robins, G., Pattison, P., Kalish, Y. and Lushern, D. (2007). An introduction to exponential random graph (p*) models for social networks. Social Networks 29, 173191.CrossRefGoogle Scholar
Ruelle, D. (1969). Statistical Mechanics: Rigorous Results. World Scientific, River Edge, NJ.Google Scholar
Radin, C. and Yin, M. (2013). Phase transitions in exponential random graphs. To appear in Ann. Appl. Prob. CrossRefGoogle Scholar
Turán, P. (1941). On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436452 (in Hungarian).Google Scholar
Yeoman, J. M. (1992). Statistical Mechanics of Phase Transitions. Clarendon Press, Oxford.CrossRefGoogle Scholar