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

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.

The Annals of Applied Probability, Vol. 29, No. 5 (October 2019), pp. 3201-3229 (29 pages) We provide a general bound on theWasserstein distance between two arbitrary distributions of sequences of ...

The statistical physics of graphs and partition functions represents a vibrant intersection of graph theory, statistical mechanics and computational complexity. By summing over an ensemble of ...

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.