The reviewed record of science sign in
Pith

arxiv: 2110.11856 · v5 · pith:52WIC7ZE · submitted 2021-10-22 · stat.ME · cs.SI· math.ST· stat.TH

L-2 Regularized maximum likelihood for β-model in large and sparse networks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:52WIC7ZErecord.jsonopen to challenge →

classification stat.ME cs.SImath.STstat.TH
keywords betanetworknetworksresultsexistinglargemodelsparse
0
0 comments X
read the original abstract

The $\beta$-model is a powerful tool for modeling large and sparse networks driven by degree heterogeneity, where many network models become infeasible due to computational challenge and network sparsity. However, existing estimation algorithms for $\beta$-model do not scale up. Also, theoretical understandings remain limited to dense networks. This paper brings several significant improvements over existing results to address the urgent needs of practice. We propose a new $\ell_2$-penalized MLE algorithm that can comfortably handle sparse networks of millions of nodes with much-improved memory parsimony. We establish the first rate-optimal error bounds and high-dimensional asymptotic normality results for $\beta$-models, under much weaker network sparsity assumptions than best existing results. Application of our method to large COVID-19 network data sets discovered meaningful results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.