Subsampling Sparse Graphons Under Minimal Assumptions

v1v2 (latest)

Subsampling Sparse Graphons Under Minimal Assumptions

29 July 2019

Purnamrita Sarkar

ArXiv (abs)PDF HTML

Papers citing "Subsampling Sparse Graphons Under Minimal Assumptions"

10 / 10 papers shown

Title
Transferability of Graph Neural Networks using Graphon and Sampling Theories A. Neuman J. Bramburger 43 1 0 25 Jul 2023
An Overview of Asymptotic Normality in Stochastic Blockmodels: Cluster Analysis and Inference Joshua Agterberg Joshua Cape 71 1 0 10 May 2023
Implications of sparsity and high triangle density for graph representation learning Hannah Sansford Alexander Modell N. Whiteley Patrick Rubin-Delanchy 61 1 0 27 Oct 2022
Higher-order accurate two-sample network inference and network hashing Meijia Shao Dong Xia Yuan Zhang Qiong Wu Shuo Chen 53 6 0 16 Aug 2022
Estimating Graph Dimension with Cross-validated Eigenvalues Fan Chen S. Roch Karl Rohe Shuqi Yu 55 14 0 06 Aug 2021
Nonparametric Two-Sample Hypothesis Testing for Random Graphs with Negative and Repeated Eigenvalues Joshua Agterberg M. Tang Carey Priebe 62 15 0 17 Dec 2020
Trading off Accuracy for Speedup: Multiplier Bootstraps for Subgraph Counts Qiaohui Lin Robert Lunde Purnamrita Sarkar 36 1 0 14 Sep 2020
On the Theoretical Properties of the Network Jackknife Qiaohui Lin Robert Lunde Purnamrita Sarkar 31 10 0 19 Apr 2020
Edgeworth expansions for network moments Yuan Zhang Dong Xia 84 26 0 14 Apr 2020
Bootstrapping Networks with Latent Space Structure Keith D. Levin Elizaveta Levina 87 34 0 25 Jul 2019