When the degree sequence is a sufficient statistic (Q663053)

In this paper there is considered a random graph model with independent adjacencies in which the degree sequence is a sufficient statistic. The model was recently discovered independently by several authors [\textit{S. Chatterjee, P. Diaconis} and \textit{A. Sly}, Ann. Appl. Probab. 21, No. 4, 1400--1435 (2011; Zbl 1234.05206); \textit{A. Barvinok and J.A. Hartigan}, Trans. Amer. Math. Soc. 364, 4323--4368 (2012; \url{doi:10.1090/S0002-9947-2012-05585-1}); \textit{A. Barvinok and J.A. Hartigan}, Random structures and algorithms (to appear) (2012; \url{doi:10.1002/rsa.20409})]. The authors of this paper 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.