Asymptotics for Sparse Exponential Random Graph Models

Abstract

We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain exact estimates for the mean and variance of the limiting probability distribution and the limiting log partition function of the edge-(single)-star model. They are in sharp contrast to the corresponding asymptotics in dense exponential random graph models. Similar analysis is done for directed sparse exponential random graph models parametrized by edges and multiple outward stars.

20 pages

References in corpus (6)

• The Asymptotics of Large Constrained Graphs
• Introduction to papers on the modeling and analysis of network data
• On the phase transition curve in a directed exponential random graph model
• Introduction to papers on the modeling and analysis of network data---II
• Asymptotic structure and singularities in constrained directed graphs
• Asymptotic Structure of Constrained Exponential Random Graph Models

Cited by in corpus (3)

• On the lower tail variational problem for random graphs
• Reciprocity in directed networks
• A detailed investigation into near degenerate exponential random graphs