Existence of maximum likelihood estimates in exponential random graph models

04/10/2022
by   Henry Bayly, et al.
0

We present a streamlined proof of the foundational result in the theory of exponential random graph models (ERGMs) that the maximum likelihood estimate exists if and only if the target statistic lies in the relative interior of the convex hull of the set of realizable statistics. We also discuss how linear dependence or "approximate linear dependence" of network statistics may lead to degeneracy during model fitting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2019

Maximum likelihood estimation for discrete exponential families and random graphs

We characterize the existence of maximum likelihood estimators for discr...
research
09/02/2020

Improving ERGM Starting Values Using Simulated Annealing

Much of the theory of estimation for exponential family models, which in...
research
02/08/2022

Likelihood-based Inference for Exponential-Family Random Graph Models via Linear Programming

This article discusses the problem of determining whether a given point,...
research
05/15/2018

On the Estimation of Parameters from Time Traces originating from an Ornstein-Uhlenbeck Process

In this article, we develop a Bayesian approach to estimate parameters f...
research
01/03/2023

Fitting mixed logit random regret minimization models using maximum simulated likelihood

This article describes the mixrandregret command, which extends the rand...
research
08/04/2021

Maximum likelihood thresholds via graph rigidity

The maximum likelihood threshold (MLT) of a graph G is the minimum numbe...
research
12/17/2022

Asymptotically Optimal Knockoff Statistics via the Masked Likelihood Ratio

This paper introduces a class of asymptotically most powerful knockoff s...

Please sign up or login with your details

Forgot password? Click here to reset