Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
From MaRDI portal
Publication:5963515
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.
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
Cites work
- scientific article; zbMATH DE number 3466323 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- A central limit theorem in the \(\beta \)-model for undirected random graphs with a diverging number of vertices
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- A simulation study of the p₁ model for directed random graphs
- Algebraic statistics for a directed random graph model with reciprocation
- An Exponential Family of Probability Distributions for Directed Graphs
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons
- Communication networks from the enron email corpus ``It's always about the people. Enron is no different
- Community structure in social and biological networks
- Consistency and Asymptotic Normality of MLE's for Exponential Models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency under sampling of exponential random graph models
- Directed random graphs with given degree distributions
- Empirical Analysis of an Evolving Social Network
- Estimating and understanding exponential random graph models
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- Graphical models, exponential families, and variational inference
- Instability, sensitivity, and degeneracy of discrete exponential families
- Maximum likelihood estimates in exponential response models
- Maximum likelihood estimation in log-linear models
- Maximum likelihood estimation in the -model
- Newton-Kantorovich method and its global convergence
- On the existence and uniqueness of maximum-likelihood estimates in the Rasch model
- Random graphs with a given degree sequence
- The Kantorovich Theorem for Newton's Method
- The Newton-Kantorovich Theorem
- The maximum entropy method
- The method of moments and degree distributions for network models
Cited in
(47)- Nonparametric discriminant analysis with network structures in predictor
- Affiliation discrete weighted networks with an increasing degree sequence
- Ties in one block comparison experiments: a generalization of the Mallows-Bradley-Terry ranking model
- Time‐varying β‐model for dynamic directed networks
- 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
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Asymptotic in the ordered networks with a noisy degree sequence
- Statistical inference in a directed network model with covariates
- A simulation study of the p₁ model for directed random graphs
- Asymptotic theory in network models with covariates and a growing number of node parameters
- Affiliation weighted networks with a differentially private degree sequence
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- Inference in a class of directed random graph models with an increasing number of parameters
- Edgeworth expansions for network moments
- Differentially private estimation in a class of bipartite graph models
- A survey of discrete methods in (algebraic) statistics for networks
- Logical differencing in dyadic network formation models with nontransferable utilities
- 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
- Network inference from temporally dependent grouped observations
- A note on asymptotic distributions in directed exponential random graph models with bi-degree sequences
- Estimation of graphical models: an overview of selected topics
- Degree-based moment estimation for ordered networks
- Asymptotic theory in bipartite graph models with a growing number of parameters
- 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
- Online network monitoring
- Asymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequence
- 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
- Estimating parameters of a directed weighted graph model with beta-distributed edge-weights
- Asymptotics in a probit model for directed networks
- Weighted directed networks with a differentially private bi-degree sequence
- Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence
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)
