Bayesian inference of network structure from unreliable data

Abstract

Most empirical studies of complex networks do not return direct, error-free measurements of network structure. Instead, they typically rely on indirect measurements that are often error-prone and unreliable. A fundamental problem in empirical network science is how to make the best possible estimates of network structure given such unreliable data. In this paper we describe a fully Bayesian method for reconstructing networks from observational data in any format, even when the data contain substantial measurement error and when the nature and magnitude of that error is unknown. The method is introduced through pedagogical case studies using real-world example networks, and specifically tailored to allow straightforward, computationally efficient implementation with a minimum of technical input. Computer code implementing the method is publicly available.

arXiv comment16 pages, 7 figures

References in corpus (12)

• Hierarchical structure and the prediction of missing links in networks
• Missing and spurious interactions and the reconstruction of complex networks
• Philosophy and the practice of Bayesian statistics
• A Conceptual Introduction to Hamiltonian Monte Carlo
• Statistical properties of sampled networks
• Network structure from rich but noisy data
• Network reconstruction and community detection from dynamics
• Friendship networks and social status
• Estimating network structure from unreliable measurements
• Structural inference for uncertain networks
• Network Structure Inference, A Survey: Motivations, Methods, and Applications
• Subsampling large graphs and invariance in networks

Cited by in corpus (16)

• Hypergraph reconstruction from network data
• Tackling the subsampling problem to infer collective properties from limited data
• Introduction to correlation networks: Interdisciplinary approaches beyond thresholding
• Latent Network Models to Account for Noisy, Multiply-Reported Social Network Data
• Hypergraph reconstruction from noisy pairwise observations
• Clustering of heterogeneous populations of networks
• Compressing network populations with modal networks reveals structural diversity
• Duality between predictability and reconstructability in complex systems
• Link Prediction Accuracy on Real-World Networks Under Non-Uniform Missing Edge Patterns
• Cutting Through the Noise to Infer Autonomous System Topology
• Simulating systematic bias in attributed social networks and its effect on rankings of minority nodes
• Community Detection in Weighted Multilayer Networks with Ambient Noise
• Symmetry-driven embedding of networks in hyperbolic space
• Feature Learning and Network Structure from Noisy Node Activity Data
• Reconstructing networks from simple and complex contagions
• Visualizing Uncertainty in Probabilistic Graphs with Network Hypothetical Outcome Plots (NetHOPs)