Subsampling sparse graphons under minimal assumptions
Biometrika · 11.02.2023 · 110 (1) · 15-32
DOI: 10.1093/biomet/asac032 ↗Kurz gefasst
Fachartikel in der Zeitschrift Biometrika, online erschienen am 02.06.2022. Verfasst von Robert Lunde und 1 weiteren Autor:innen. Die Arbeit wurde bisher 13-mal zitiert (Crossref) und nennt 68 Literaturangaben. Gefördert von: National Science Foundation.
Abstract (Originalsprache)
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 the number of vertices in the network. Furthermore, under appropriate sparsity conditions, we derive limiting distributions for the nonzero eigenvalues of an adjacency matrix under the sparse graphon model. Our weak convergence result implies the consistency of our subsampling procedures for eigenvalues under appropriate conditions.
Förderung
- National Science Foundation
Zitieren
APA
Lunde, R., & Sarkar, P. (2023). Subsampling sparse graphons under minimal assumptions. Biometrika, 110(1), 15-32. https://doi.org/10.1093/biomet/asac032
Vancouver
Lunde R, Sarkar P. Subsampling sparse graphons under minimal assumptions. Biometrika. 2023;110(1):15-32. doi:10.1093/biomet/asac032
BibTeX
@article{Lunde2023,
author = {Lunde, Robert and Sarkar, Purnamrita},
title = {Subsampling sparse graphons under minimal assumptions},
journal = {Biometrika},
year = {2023},
volume = {110},
number = {1},
pages = {15--32},
doi = {10.1093/biomet/asac032}
}
EUVIMED