REVIEW 3 cited by
A Sparse Beta Regression Model for Network Analysis
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
For statistical analysis of network data, the $\beta$-model has emerged as a useful tool, thanks to its flexibility in incorporating nodewise heterogeneity and theoretical tractability. To generalize the $\beta$-model, this paper proposes the Sparse $\beta$-Regression Model (S$\beta$RM) that unites two research themes developed recently in modelling homophily and sparsity. In particular, we employ differential heterogeneity that assigns weights only to important nodes and propose penalized likelihood with an $\ell_1$ penalty for parameter estimation. While our estimation method is closely related to the LASSO method for logistic regression, we develop new theory emphasizing the use of our model for dealing with a parameter regime that can handle sparse networks usually seen in practice. More interestingly, the resulting inference on the homophily parameter demands no debiasing normally employed in LASSO type estimation. We provide extensive simulation and data analysis to illustrate the use of the model. As a special case of our model, we extend the Erd\H{o}s-R\'{e}nyi model by including covariates and develop the associated statistical inference for sparse networks, which may be of independent interest.
Forward citations
Cited by 3 Pith papers
-
Dynamic Networks with Node Heterogeneity and Homophily
A dynamic network model jointly estimating node heterogeneity and observed plus latent homophily, with a normalized squared loss and consistency theory for high-dimensional node-specific parameters.
-
Analysis of Networks via the Sparse $\beta$-Model
The Sparse β-Model adds a global sparsity parameter to the β-model while allowing only a few node-specific parameters to be nonzero, giving consistent, asymptotically normal estimates for sparse networks and an ℓ0-pen...
-
Subgraph counting estimation for the $\beta$-model in sparse networks
A cycle-counting-ratio estimator for the β-model achieves minimax-optimal MSE and consistency under the weak conditions θ_max→0 and θ_t‖θ‖₁→∞, even at network densities near log n/n.
Discussion (0). Continue with ORCID to comment.