Asymptotics in directed exponential random graph models with an increasing bi-degree sequence

From MaRDI portal
Publication:5963515

DOI10.1214/15-AOS1343zbMATH Open1331.62110arXiv1408.1156OpenAlexW1876291699MaRDI QIDQ5963515FDOQ5963515

Chenlei Leng, Ting Yan, Ji Zhu

Publication date: 22 February 2016

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we provide for the first time a rigorous analysis of directed exponential random graph models using the in-degrees and out-degrees as sufficient statistics with binary as well as continuous weighted edges. We establish the uniform consistency and the asymptotic normality for the maximum likelihood estimate, when the number of parameters grows and only one realized observation of the graph is available. One key technique in the proofs is to approximate the inverse of the Fisher information matrix using a simple matrix with high accuracy. Numerical studies confirm our theoretical findings.


Full work available at URL: https://arxiv.org/abs/1408.1156





Cites Work


Cited In (38)

Uses Software






This page was built for publication: Asymptotics in directed exponential random graph models with an increasing bi-degree sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963515)