MLLGSTMEOct 31, 2022

SIMPLE-RC: Group Network Inference with Non-Sharp Nulls and Weak Signals

arXiv:2211.00128v15 citationsh-index: 110
Originality Incremental advance
AI Analysis

This work addresses network inference challenges in fields like social and medical sciences, offering a method for group-level analysis with weaker signals, though it is incremental as it builds on an existing framework.

The paper tackles the problem of testing whether groups of nodes in large networks share similar membership profiles under weak signals, proposing SIMPLE-RC, which extends a prior method to handle non-sharp null hypotheses and achieves improved performance in simulations and real data.

Large-scale network inference with uncertainty quantification has important applications in natural, social, and medical sciences. The recent work of Fan, Fan, Han and Lv (2022) introduced a general framework of statistical inference on membership profiles in large networks (SIMPLE) for testing the sharp null hypothesis that a pair of given nodes share the same membership profiles. In real applications, there are often groups of nodes under investigation that may share similar membership profiles at the presence of relatively weaker signals than the setting considered in SIMPLE. To address these practical challenges, in this paper we propose a SIMPLE method with random coupling (SIMPLE-RC) for testing the non-sharp null hypothesis that a group of given nodes share similar (not necessarily identical) membership profiles under weaker signals. Utilizing the idea of random coupling, we construct our test as the maximum of the SIMPLE tests for subsampled node pairs from the group. Such technique reduces significantly the correlation among individual SIMPLE tests while largely maintaining the power, enabling delicate analysis on the asymptotic distributions of the SIMPLE-RC test. Our method and theory cover both the cases with and without node degree heterogeneity. These new theoretical developments are empowered by a second-order expansion of spiked eigenvectors under the $\ell_\infty$-norm, built upon our work for random matrices with weak spikes. Our theoretical results and the practical advantages of the newly suggested method are demonstrated through several simulation and real data examples.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes