Multivariate Inference of Network Moments by Subsampling
Mingyu Qi, Chen-Wei Hua, Tianxi Li, Wen Zhou

TL;DR
This paper establishes the validity of node subsampling for joint distribution inference of network motifs in sparse graphs, enabling new two-sample tests for unmatchable networks with unequal densities.
Contribution
It proves asymptotic accuracy of multivariate subsampling for network moments and introduces a novel procedure for two-sample testing in complex network settings.
Findings
Node subsampling accurately approximates joint distribution of network moments.
Proposed method enables valid two-sample tests for unmatchable networks.
Application to biological networks reveals structural differences undetectable by marginal tests.
Abstract
Network moments--rescaled counts of motifs such as stars and triangles--are fundamental summaries of network structure, widely used in goodness-of-fit testing, model selection, and network comparison. While the univariate distribution of a single network moment can be approximated by subsampling, the consistency of subsampling for their {\it joint} distribution has remained unestablished. In this paper, we prove that node subsampling provides an asymptotically accurate approximation of the joint distribution of multiple network moments under a general sparse graphon model. The theoretical analysis requires a careful characterization of the dependence structure among network moments and the corresponding multivariate asymptotic convergence, going substantially beyond existing univariate results. Building on this foundation, we address a practically important open problem: two-sample…
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.
