Subsampling Sparse Graphons Under Minimal Assumptions

07/29/2019
by   Robert Lunde, et al.
0

We establish a general theory for subsampling network data generated by the sparse graphon model. In contrast to previous work for network data, we demonstrate validity under minimal assumptions; the main requirement is weak convergence of the functional of interest. We study the properties of two subsampling procedures: vertex subsampling, and p-subsampling. For the first procedure, we prove validity under the mild condition that the number of subsampled vertices is o(n). For the second, we establish validity under analogous conditions on the expected subsample size. For both procedures, we also establish conditions under which uniform validity holds. Under appropriate sparsity conditions, we also derive limiting distributions for the nonzero eigenvalues of the adjacency matrix of a low rank sparse graphon. Our weak convergence result immediately yields the validity of subsampling for the nonzero eigenvalues under suitable assumptions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2019

Sample Splitting and Weak Assumption Inference For Time Series

We consider the problem of inference after model selection under weak as...
research
02/19/2019

Asymptotic Theory of Eigenvectors for Large Random Matrices

Characterizing the exact asymptotic distributions of high-dimensional ei...
research
02/13/2022

Testing the number of common factors by bootstrap in high-dimensional factor models

This paper proposes to test the number of common factors in high-dimensi...
research
02/21/2022

On the limiting amplitude principle for the wave equation with variable coefficients

In this paper, we prove new results on the validity of the limiting ampi...
research
03/27/2022

Invariance principle and CLT for the spiked eigenvalues of large-dimensional Fisher matrices and applications

This paper aims to derive asymptotical distributions of the spiked eigen...
research
01/14/2020

Inference for linear forms of eigenvectors under minimal eigenvalue separation: Asymmetry and heteroscedasticity

A fundamental task that spans numerous applications is inference and unc...

Please sign up or login with your details

Forgot password? Click here to reset