A Deterministic Partition Function Approximation for Exponential Random Graph Models

Exponential Random Graphs Models (ERGM) are common, simple statistical models for social network and other network structures. Unfortunately, inference and learning with them is hard even for small networks because their partition functions are intractable for precise computation. In this paper, we introduce a new quadratic time deterministic approximation to these partition functions. Our main insight enabling this advance is that subgraph statistics is sufficient to derive a lower bound for partition functions given that the model is not dominated by a few graphs. The proposed method differs from existing methods in its ways of exploiting asymptotic properties of subgraph statistics. Compared to the current Monte Carlo simulation based methods, the new method is scalable, stable, and precise enough for inference tasks.

Authors

• Wen Pu University of Illinois at Urbana-Champaign
• Jaesik Choi Korea Advanced Institute of Science & Technology INEEJI
• Yunseong Hwang
• Eyal Amir

Keywords

No keywords are indexed for this paper.