Maximum Likelihood Estimation in Network Models
Year: 2011
Type: preprint
Abstract: We study maximum likelihood estimation for the statistical model for both directed and undirected random graph models in which the degree sequences are minimal sufficient statistics. In the undirected case, the model is known as the beta model. We derive necessary and sufficient conditions for the existence of the MLE that are based on the polytope of degree sequences, and wecharacterize in a combinatorial fashion sample points leading to a nonexistent MLE, and non-estimability of the probability parameters under a nonexistent MLE. We formulate conditions that guarantee that the MLE exists with probability tending to one as the number nodes increases. By reparametrizing the beta model as a log-linear model under product multinomial sampling scheme, we are able to provide usable algorithms for detecting nonexistence of the MLE and for identifying non-estimable parameters. We illustrate our approach on other random graph models for networks, such as the Rasch model, the Bradley-Terry model and the more general p1 model of Holland and Leinhardt (1981).
Source: arXiv (Cornell University)
Institutions: Carnegie Mellon University, University of Illinois Chicago
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1882316525
