Network structure from rich but noisy data

Abstract

Driven by growing interest in the sciences, industry, and among the broader public, a large number of empirical studies have been conducted in recent years of the structure of networks ranging from the internet and the world wide web to biological networks and social networks. The data produced by these experiments are often rich and multimodal, yet at the same time they may contain substantial measurement error. In practice, this means that the true network structure can differ greatly from naive estimates made from the raw data, and hence that conclusions drawn from those naive estimates may be significantly in error. In this paper we describe a technique that circumvents this problem and allows us to make optimal estimates of the true structure of networks in the presence of both richly textured data and significant measurement uncertainty. We give example applications to two different social networks, one derived from face-to-face interactions and one from self-reported friendships.

10 pages, 3 figures. Substantially revised and expanded from previous version

References in corpus (5)

• ARACNE: An Algorithm for the Reconstruction of Gene Regulatory Networks in a Mammalian Cellular Context
• Hierarchical structure and the prediction of missing links in networks
• Missing and spurious interactions and the reconstruction of complex networks
• Modeling social networks from sampled data
• A heuristic approach to author name disambiguation in bibliometrics databases for large-scale research assessments

Cited by in corpus (39)

• The physics of higher-order interactions in complex systems
• Network reconstruction and community detection from dynamics
• Estimating network structure from unreliable measurements
• Autonomous inference of complex network dynamics from incomplete and noisy data
• Reconstructing networks with unknown and heterogeneous errors
• Bayesian inference of network structure from unreliable data
• Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
• Big Networks: A Survey
• Linking theory and empirics: a general framework to model opinion formation processes
• Distinguishing simple and complex contagion processes on networks
• The structured backbone of temporal social ties
• Community Detection in Bipartite Networks with Stochastic Blockmodels
• Reconstructing networks
• Hypergraph reconstruction from dynamics
• Tackling the subsampling problem to infer collective properties from limited data
• Estimating the sensitivity of centrality measures w.r.t. measurement errors
• Latent Network Models to Account for Noisy, Multiply-Reported Social Network Data
• Mapping flows on sparse networks with missing links
• Broken detailed balance and entropy production in directed networks
• Layer reconstruction and missing link prediction of multilayer network with a Maximum A Posteriori estimation
• Network mutual information measures for graph similarity
• Mapping flows on weighted and directed networks with incomplete observations
• Hypergraph reconstruction from noisy pairwise observations
• Bayesian Dynamic Modeling and Monitoring of Network Flows
• Clustering of heterogeneous populations of networks
• Compressing network populations with modal networks reveals structural diversity
• Distances and Isomorphism between Networks: Stability and Convergence of Network Invariants
• Influence maximization in noisy networks
• Sampling networks by nodal attributes
• Geometric graphs from data to aid classification tasks with graph convolutional networks
• Cutting Through the Noise to Infer Autonomous System Topology
• Multiplex reconstruction with partial information
• Joint Inference of Diffusion and Structure in Partially Observed Social Networks Using Coupled Matrix Factorization
• Reconstructing Network Structures from Partial Measurements
• Simulating systematic bias in attributed social networks and its effect on rankings of minority nodes
• Democratic summary of public opinions in free-response surveys
• Feature Learning and Network Structure from Noisy Node Activity Data
• Symmetry-driven embedding of networks in hyperbolic space
• Bayesian Inference of a Social Graph with Trace Feasibility Guarantees