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 ...

Exponential graphs are graphs in the form \(y = k^x\). These graphs increase rapidly in the \(y\) direction and will never fall below the \(x\)-axis.

We explore the asymptotic properties of strategic models of network formation in very large populations. Specifically, we focus on (undirected) exponential random graph models. We want to recover a ...