Bootstrapping Networks with Latent Space Structure
Not on the map. Why?
Abstract (arXiv)
A core problem in statistical network analysis is to develop network analogues of classical techniques. The problem of bootstrapping network data stands out as especially challenging, since typically one observes only a single network, rather than a sample. Here we propose two methods for obtaining bootstrap samples for networks drawn from latent space models. The first method generates bootstrap replicates of network statistics that can be represented as U-statistics in the latent positions, and avoids actually constructing new bootstrapped networks. The second method generates bootstrap replicates of whole networks, and thus can be used for bootstrapping any network function. Commonly studied network quantities that can be represented as U-statistics include many popular summaries, such as average degree and subgraph counts, but other equally popular summaries, such as the clustering coefficient, are not expressible as U-statistics and thus require the second bootstrap method. Under the assumption of a random dot product graph, a type of latent space network model, we show consistency of the proposed bootstrap methods. We give motivating examples throughout and demonstrate the effectiveness of our methods on synthetic data.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 2; 2025: 3; 2026: 1.
11 papers.
- 2023ConGraT: Self-Supervised Contrastive Pretraining for Joint Graph and Text Embeddingscited by 32
- 2022Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labelscited by 3
- 2022Higher-order accurate two-sample network inference and network hashingcited by 1
- 2025Weighted Random Dot Product Graphscited by 1
- 2021Block Dense Weighted Networks with Augmented Degree Correctioncited by 0
- 2022Pitfalls of Climate Network Construction: A Statistical Perspectivecited by 0
- 2024Bias-Corrected Joint Spectral Embedding for Multilayer Networks with Invariant Subspace: Entrywise Eigenvector Perturbation and Inferencecited by 0
- 2024Valid Bootstraps for Network Embeddings with Applications to Network Visualisationcited by 0
- 2025LOBSTUR: A Local Bootstrap Framework for Tuning Unsupervised Representations in Graph Neural Networkscited by 0
- 2025Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)cited by 0
- 2026Efficient Synthetic Network Generation via Latent Embedding Reconstructioncited by 0
- 2026Efficient Synthetic Network Generation via Latent Embedding Reconstruction31 May 2026
- 2025Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)3 Jun 2025
- 2025LOBSTUR: A Local Bootstrap Framework for Tuning Unsupervised Representations in Graph Neural Networks20 May 2025
- 2025Weighted Random Dot Product Graphs6 May 2025
- 2024Valid Bootstraps for Network Embeddings with Applications to Network Visualisation28 Oct 2024
- 2024Bias-Corrected Joint Spectral Embedding for Multilayer Networks with Invariant Subspace: Entrywise Eigenvector Perturbation and Inference12 Jun 2024
- 2023ConGraT: Self-Supervised Contrastive Pretraining for Joint Graph and Text Embeddings23 May 2023
- 2022Pitfalls of Climate Network Construction: A Statistical Perspective5 Nov 2022
- 2022Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels18 Aug 2022
- 2022Higher-order accurate two-sample network inference and network hashing16 Aug 2022
- 2021Block Dense Weighted Networks with Augmented Degree Correction26 May 2021