Reconstructing networks with unknown and heterogeneous errors
Not on the map. Why?
Abstract (arXiv)
The vast majority of network datasets contains errors and omissions, although this is rarely incorporated in traditional network analysis. Recently, an increasing effort has been made to fill this methodological gap by developing network reconstruction approaches based on Bayesian inference. These approaches, however, rely on assumptions of uniform error rates and on direct estimations of the existence of each edge via repeated measurements, something that is currently unavailable for the majority of network data. Here we develop a Bayesian reconstruction approach that lifts these limitations by not only allowing for heterogeneous errors, but also for single edge measurements without direct error estimates. Our approach works by coupling the inference approach with structured generative network models, which enable the correlations between edges to be used as reliable uncertainty estimates. Although our approach is general, we focus on the stochastic block model as the basic generative process, from which efficient nonparametric inference can be performed, and yields a principled method to infer hierarchical community structure from noisy data. We demonstrate the efficacy of our approach with a variety of empirical and artificial networks.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 2; 2024: 1; 2025: 1; 2026: 1.
11 papers.
- 2021Disentangling homophily, community structure and triadic closure in networkscited by 6
- 2021Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truthscited by 3
- 2022Implicit models, latent compression, intrinsic biases, and cheap lunches in community detectioncited by 3
- 2024Symmetry-driven embedding of networks in hyperbolic spacecited by 1
- 2025Uncertainty quantification and posterior sampling for network reconstructioncited by 1
- 2021Geodesic Length Distribution in Sparse Network Ensemblescited by 0
- 2022Cognitive modelling with multilayer networks: Insights, advancements and future challengescited by 0
- 2022Bayesian Inference of Transition Matrices from Incomplete Graph Data with a Topological Priorcited by 0
- 2023Fitting Low-rank Models on Egocentrically Sampled Partial Networkscited by 0
- 2023Machine learning of network inference enhancement from noisy measurementscited by 0
- 2026Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriorscited by 0
- 2026Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors18 May 2026
- 2025Uncertainty quantification and posterior sampling for network reconstruction10 Mar 2025
- 2024Symmetry-driven embedding of networks in hyperbolic space15 Jun 2024
- 2023Machine learning of network inference enhancement from noisy measurements5 Sep 2023
- 2023Fitting Low-rank Models on Egocentrically Sampled Partial Networks9 Mar 2023
- 2022Bayesian Inference of Transition Matrices from Incomplete Graph Data with a Topological Prior27 Oct 2022
- 2022Implicit models, latent compression, intrinsic biases, and cheap lunches in community detection17 Oct 2022
- 2022Cognitive modelling with multilayer networks: Insights, advancements and future challenges2 Oct 2022
- 2021Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths30 Nov 2021
- 2021Geodesic Length Distribution in Sparse Network Ensembles3 Nov 2021
- 2021Disentangling homophily, community structure and triadic closure in networks7 Jan 2021