When the degree sequence is a sufficient statistic

There is a uniquely defined random graph model with independent adjacencies in which the degree sequence is a sufficient statistic. The model was recently discovered independently by several authors. Here we join to the statistical investigation of the model, proving that if the degree sequence is in the interior of the polytope defined by the Erdős–Gallai conditions, then a unique maximum likelihood estimate exists.