Critical phenomena in exponential random graphs

Abstract

The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence between particle states in a grand canonical ensemble of statistical physics. By adjusting the specific values of these subgraph densities, one can analyze the influence of various local features on the global structure of the network. Loosely put, a phase transition occurs when a singularity arises in the limiting free energy density, as it is the generating function for the limiting expectations of all thermodynamic observables. We derive the full phase diagram for a large family of 3-parameter exponential random graph models with attraction and show that they all consist of a first order surface phase transition bordered by a second order critical curve.

14 pages, 8 figures

References in corpus (1)

• Solution for the properties of a clustered network

Cited by in corpus (14)

• Estimating and understanding exponential random graph models
• The Asymptotics of Large Constrained Graphs
• On the phase transition curve in a directed exponential random graph model
• On the lower tail variational problem for random graphs
• Asymptotic structure and singularities in constrained directed graphs
• On the asymptotics of constrained exponential random graphs
• Asymptotics for Sparse Exponential Random Graph Models
• Reciprocity in directed networks
• Mixing Time of Vertex-Weighted Exponential Random Graphs
• A detailed investigation into near degenerate exponential random graphs
• Asymptotic Structure of Constrained Exponential Random Graph Models
• Phase Transitions in Edge-Weighted Exponential Random Graphs: Near-Degeneracy and Universality
• Ensemble equivalence for dense graphs
• Ground States for Exponential Random Graphs