The reviewed record of science sign in
Pith

arxiv: 2405.19637 · v2 · pith:I3FMNSCN · submitted 2024-05-30 · stat.ME · math.ST· stat.TH

Inference in semiparametric formation models for directed networks

Reviewed by Pithpith:I3FMNSCNopen to challenge →

classification stat.ME math.STstat.TH
keywords parametersdegreehomophilyunknowndirectedestimatorshigh-dimensionalmodel
0
0 comments X
read the original abstract

We propose a semiparametric model for dyadic link formations in directed networks. The model contains a set of degree parameters that measure different effects of popularity or outgoingness across nodes, a regression parameter vector that reflects the homophily effect resulting from the nodal attributes or pairwise covariates associated with edges, and a set of latent random noises with unknown distributions. Our interest lies in inferring the unknown degree parameters and homophily parameters. The dimension of the degree parameters increases with the number of nodes. Under the high-dimensional regime, we develop a kernel-based least squares approach to estimate the unknown parameters. The major advantage of our estimator is that it does not encounter the incidental parameter problem for the homophily parameters. We prove consistency of all the resulting estimators of the degree parameters and homophily parameters. We establish high-dimensional central limit theorems for the proposed estimators and provide several applications of our general theory, including testing the existence of degree heterogeneity, testing sparse signals and recovering the support. Simulation studies and a real data application are conducted to illustrate the finite sample performance of the proposed methods.

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.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Bagging the Network

    econ.EM 2024-10 unverdicted novelty 7.0

    A bagging-based estimator for dyadic networks with fixed effects attains asymptotic normality and the Cramér-Rao bound for both TU and NTU links by using joint MOM, Le Cam refinement, and split-network jackknife.