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
Authors: Ting Yan, Chenlei Leng, 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
Recommendations
- A note on asymptotic distributions in directed exponential random graph models with bi-degree sequences
- Directed weighted random graphs with an increasing bi-degree sequence
- Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence
- Asymptotics for sparse exponential random graph models
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
consistencymaximum likelihood estimationcentral limit theoremFisher information matrixbi-degree sequencedirected exponential random graph models
Point estimation (62F10) Asymptotic properties of parametric estimators (62F12) Asymptotic distribution theory in statistics (62E20) Random graphs (graph-theoretic aspects) (05C80) Sufficient statistics and fields (62B05)
Cites Work
- Graphical models, exponential families, and variational inference
- Maximum likelihood estimates in exponential response models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Empirical Analysis of an Evolving Social Network
- An Exponential Family of Probability Distributions for Directed Graphs
- Maximum likelihood estimation in log-linear models
- Community structure in social and biological networks
- Title not available (Why is that?)
- The method of moments and degree distributions for network models
- Instability, sensitivity, and degeneracy of discrete exponential families
- Communication networks from the enron email corpus ``It's always about the people. Enron is no different
- Title not available (Why is that?)
- Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons
- Estimating and understanding exponential random graph models
- Consistency under sampling of exponential random graph models
- Maximum likelihood estimation in the \(\beta\)-model
- Random graphs with a given degree sequence
- The Newton-Kantorovich Theorem
- A central limit theorem in the \(\beta \)-model for undirected random graphs with a diverging number of vertices
- The maximum entropy method
- The Kantorovich Theorem for Newton's Method
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Directed random graphs with given degree distributions
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Algebraic statistics for a directed random graph model with reciprocation
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- Newton-Kantorovich method and its global convergence
- On the existence and uniqueness of maximum-likelihood estimates in the Rasch model
- Title not available (Why is that?)
- Consistency and Asymptotic Normality of MLE's for Exponential Models
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- A simulation study of the \(p_1\) model for directed random graphs
Cited In (47)
- Nonparametric discriminant analysis with network structures in predictor
- Time‐varying β‐model for dynamic directed networks
- Affiliation discrete weighted networks with an increasing degree sequence
- Ties in one block comparison experiments: a generalization of the Mallows-Bradley-Terry ranking model
- A note on asymptotic distributions in a directed network model with degree heterogeneity and homophily
- Variable Selection for High-Dimensional Nodal Attributes in Social Networks with Degree Heterogeneity
- A network Poisson model for weighted directed networks with covariates
- Weighted exponential random graph models: scope and large network limits
- Statistical inference in a directed network model with covariates
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Asymptotic in the ordered networks with a noisy degree sequence
- Asymptotic theory in network models with covariates and a growing number of node parameters
- A simulation study of the \(p_1\) model for directed random graphs
- Affiliation weighted networks with a differentially private degree sequence
- Inference in a class of directed random graph models with an increasing number of parameters
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- Differentially private estimation in a class of bipartite graph models
- Edgeworth expansions for network moments
- Logical differencing in dyadic network formation models with nontransferable utilities
- A survey of discrete methods in (algebraic) statistics for networks
- 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
- Estimation of graphical models: an overview of selected topics
- A note on asymptotic distributions in directed exponential random graph models with bi-degree sequences
- Network inference from temporally dependent grouped observations
- Asymptotic theory in bipartite graph models with a growing number of parameters
- Degree-based moment estimation for ordered networks
- A new model for preferential attachment scheme with time-varying parameters
- Asymptotic in undirected random graph models with a noisy degree sequence
- Asymptotics of score test in the generalized \(\beta\)-model for networks
- Directed weighted random graphs with an increasing bi-degree sequence
- Approximate estimation in a class of directed networks
- Asymptotic distributions in affiliation networks with an increasing sequence
- Inference in a probit model for affiliation networks
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Nonparametric identification in index models of link formation
- Asymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequence
- Online network monitoring
- Directed Networks with a Differentially Private Bi-degree Sequence
- The method of moments and degree distributions for network models
- A note on asymptotic distributions in a network model with degree heterogeneity and homophily
- Asymptotics for sparse exponential random graph models
- Bivariate gamma model
- Asymptotics in a probit model for directed networks
- Weighted directed networks with a differentially private bi-degree sequence
- Estimating parameters of a directed weighted graph model with beta-distributed edge-weights
- Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence
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)
