An Annotated Graph Model with Differential Degree Heterogeneity for Directed Networks
arXiv:2108.09504
Abstract
Directed networks are conveniently represented as graphs in which ordered edges encode interactions between vertices. Despite their wide availability, there is a shortage of statistical models amenable for inference, specially when contextual information and degree heterogeneity are present. This paper presents an annotated graph model with parameters explicitly accounting for these features. To overcome the curse of dimensionality due to modelling degree heterogeneity, we introduce a sparsity assumption and propose a penalized likelihood approach with -regularization for parameter estimation. We study the estimation and selection consistency of this approach under a sparse network assumption, and show that inference on the covariate parameter is straightforward, thus bypassing the need for the kind of debiasing commonly employed in -penalized likelihood estimation. Simulation and data analysis corroborate our theoretical findings.
arXiv comment69 pages, 9 figures, 4 tables. arXiv admin note: substantial text overlap with arXiv:2010.13604
References in corpus (14)
- Community structure in social and biological networks
- Modularity and community structure in networks
- Stochastic blockmodels and community structure in networks
- High-dimensional Ising model selection using -regularized logistic regression
- Fast community detection by SCORE
- Sparse graphs using exchangeable random measures
- Coauthorship and Citation Networks for Statisticians
- Covariate-assisted spectral clustering
- Network histograms and universality of blockmodel approximation
- A central limit theorem in the -model for undirected random graphs with a diverging number of vertices
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Mixed Membership Estimation for Social Networks
- Detecting Latent Communities in Network Formation Models
- Analysis of Networks via the Sparse -Model