When the degree sequence is a sufficient statistic
type: Item
instance of: scholarly article
title: When the degree sequence is a sufficient statistic
zbMATH Open document ID: 1263.62029
published in: Acta Mathematica Hungarica
publication date: 2012-02-13T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 62F10
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 62B05
zbMATH DE Number: 6006166
zbMATH Keywords: degree sequence of graphs
zbMATH Keywords: random graphs
zbMATH Keywords: sufficient statistics
zbMATH Keywords: maximum likelihood estimation
author: Villő Csiszár
author: Péter Hussami
author: János Komlós
author: Tamás F. Móri
author: Lídia Rejtő
author: Gábor Tusnády
MaRDI profile type: Publication
full work available at URL: s10474-011-0125-z
OpenAlex ID: W1992852203
cites work: An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
cites work: Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
cites work: Information Theory and Statistics: A Tutorial
cites work: Conditional independence relations and log-linear models for random matchings
cites work: Extreme degree sequences of simple graphs
cites work: Seven criteria for integer sequences being graphic
DOI: 10.1007/S10474-011-0125-Z
description: scientific article; zbMATH DE number 6006166