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

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.

Published at http://dx.doi.org/10.1214/15-AOS1343 in the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (13)

• A High-Resolution Human Contact Network for Infectious Disease Transmission
• Consistency of community detection in networks under degree-corrected stochastic block models
• Estimating and understanding exponential random graph models
• Random graphs with a given degree sequence
• The method of moments and degree distributions for network models
• Consistency under sampling of exponential random graph models
• Maximum likelihood estimation in log-linear models
• Maximum lilkelihood estimation in the $\beta$-model
• A central limit theorem in the $\beta$-model for undirected random graphs with a diverging number of vertices
• Constructing and sampling directed graphs with given degree sequences
• Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
• Maximum entropy distributions on graphs
• Estimating parameters of a multipartite loglinear graph model via the EM algorithm

Cited by in corpus (17)

• Exponential-Family Models of Random Graphs: Inference in Finite-, Super-, and Infinite Population Scenarios
• Concentration and consistency results for canonical and curved exponential-family models of random graphs
• Consistent structure estimation of exponential-family random graph models with block structure
• Online network monitoring
• The $\beta$-model for Random Graphs --- Regression, Cramér-Rao Bounds, and Hypothesis Testing
• Directed Networks with a Differentially Private Bi-degree Sequence
• Logical Differencing in Dyadic Network Formation Models with Nontransferable Utilities
• An Annotated Graph Model with Differential Degree Heterogeneity for Directed Networks
• A Unified Framework for Inference in Network Models with Degree Heterogeneity and Homophily
• Pseudo-likelihood-based $M$-estimation of random graphs with dependent edges and parameter vectors of increasing dimension
• Time-varying $\beta$-model for dynamic directed networks
• Analysis of Networks via the Sparse $\beta$-Model
• A Probit Network Model with Arbitrary Dependence
• A network Poisson model for weighted directed networks with covariates
• Affiliation networks with an increasing degree sequence
• A sparse $p_0$ model with covariates for directed networks
• Weighted directed networks with a differentially private bi-degree sequence