Maximum entropy based testing in network models: ERGMs and constrained optimization
Subhro Ghosh, Rathindra Nath Karmakar, and Samriddha Lahiry

TL;DR
This paper introduces a maximum entropy-based framework for testing goodness-of-fit and two-sample hypotheses in network models, including ERGMs and Erdős-Rényi graphs, across different graph density regimes.
Contribution
It develops a novel Lagrange multiplier-based test statistic for network models, unifying various regimes and connecting to classical score tests.
Findings
Consistent testing procedures for fixed and growing network sizes.
Applicable to dense ERGMs and sparse Erdős-Rényi graphs.
Leverages nonlinear large deviation theory for analysis.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Mental Health Research Topics · Complex Systems and Time Series Analysis
