When the degree sequence is a sufficient statistic

DOI10.1007/s10474-011-0125-zzbMath1263.62029OpenAlexW1992852203MaRDI QIDQ663053

Gábor Tusnády, János Komlós, Villo Csiszár, Tamás F. Móri, Péter Hussami, Lídia Rejtő

Publication date: 13 February 2012

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-011-0125-z

zbMATH Keywords

maximum likelihood estimationrandom graphssufficient statisticsdegree sequence of graphs

Mathematics Subject Classification ID

Point estimation (62F10) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07) Sufficient statistics and fields (62B05)

Related Items

Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, Testing goodness of fit of random graph models

Cites Work

• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• Conditional independence relations and log-linear models for random matchings
• Extreme degree sequences of simple graphs
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• Seven criteria for integer sequences being graphic
• Information Theory and Statistics: A Tutorial