Maximum entropy based testing in network models: ERGMs and constrained optimization

TL;DR

This paper investigates goodness-of-fit and two-sample testing procedures for statistical networks based on the principle of maximum entropy (MaxEnt) and shows that the proposed Lagrange-multiplier framework connects naturally to classical score tests for constrained maximum likelihood estimation.

Abstract

Stochastic network models play a central role across a wide range of scientific disciplines, and questions of statistical inference arise naturally in this context. In this paper we investigate goodness-of-fit and two-sample testing procedures for statistical networks based on the principle of maximum entropy (MaxEnt). Our approach formulates a constrained entropy-maximization problem on the space of networks, subject to prescribed structural constraints. The resulting test statistics are defined through the Lagrange multipliers associated with the constrained optimization problem, which, to our knowledge, is novel in the statistical networks literature. We establish consistency in the classical regime where the number of vertices is fixed. We then consider asymptotic regimes in which the graph size grows with the sample size, developing tests for both dense and sparse settings. In the dense case, we analyze exponential random graph models (ERGM) (including the Erdös-Rènyi models), while in the sparse regime our theory applies to Erd{ö}s-R{è}nyi graphs. Our analysis leverages recent advances in nonlinear large deviation theory for random graphs. We further show that the proposed Lagrange-multiplier framework connects naturally to classical score tests for constrained maximum likelihood estimation. The results provide a unified entropy-based framework for network model assessment across diverse growth regimes.

Theorems & Definitions (55)

• Theorem 3.1
• Theorem 3.2
• Corollary 3.1
• proof
• Theorem 3.3
• Theorem 3.4
• Lemma 3.1
• Theorem 3.5
• Corollary 3.2
• proof