Subsampling sparse graphons under minimal assumptions
Subsampling sparse graphons under minimal assumptions
Summary We study the properties of two subsampling procedures for networks, vertex subsampling and $p$-subsampling, under the sparse graphon model. The consistency of network subsampling is demonstrated under the minimal assumptions of weak convergence of the corresponding network statistics and an expected subsample size growing to infinity more slowly than …