Testing degree heterogeneity in directed networks
Lu Pan, Qiuping Wang, Ting Yan

TL;DR
This paper develops likelihood ratio tests for degree heterogeneity in directed networks, establishing their asymptotic distributions in various high-dimensional settings, and verifies results through simulations and real data analysis.
Contribution
It extends Wilks-type theorems to directed graphs in high-dimensional regimes, involving complex asymptotic expansions and new matrix approximations.
Findings
Normalized likelihood ratio statistic converges to normal distribution in increasing dimensions.
Chi-square distribution convergence for fixed dimensions as network size grows.
Simulation and real data confirm theoretical asymptotic results.
Abstract
In this study, we focus on the likelihood ratio tests in the model for testing degree heterogeneity in directed networks, which is an exponential family distribution on directed graphs with the bi-degree sequence as the naturally sufficient statistic. For testing the homogeneous null hypotheses , we establish Wilks-type results in both increasing-dimensional and fixed-dimensional settings. For increasing dimensions, the normalized log-likelihood ratio statistic converges in distribution to a standard normal distribution. For fixed dimensions, converges in distribution to a chi-square distribution with degrees of freedom as , independent of the nuisance…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Bioinformatics and Genomic Networks · Advanced Graph Neural Networks
