Approximation of homogeneous networks using Exponential Random Graph Models

Giacomo Ceoldo · 2018

Every homogeneous network can be approximated by an Exponential Random Graph Model with sufficient statistics that depends on the eigenvalue distribution, the main result is the computation of the relative entropy between the real and approximating model

Read the paper · More papers on PaperTik