Academic Commons

Software

Source codes for GLMLE algorithm

He, Ran; Zheng, Tian

These are the R source codes for the algorithm proposed for fitting exponential random graph models (ERGMs) on large social networks in our paper "Estimation of exponential random graph models for large social networks via graph limits". Specifically, the ERGM model we implement is the one that consider homomorphism densities of edges, two-stars and triangles, the one we examine in the above paper.

Files

More About This Work

Academic Units
Statistics
Published Here
October 24, 2014

Notes

View the paper "Estimation of exponential random graph models for large social networks via graph limits" in Academic Commons at http://dx.doi.org/10.7916/D8S46QVQ or on the journal website at http://dx.doi.org/10.1007./s13278-015-0247-3.

Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.