Estimating network structure from unreliable measurements
M. E. J. Newman

TL;DR
This paper introduces a general method for estimating network structure and properties from unreliable, noisy, or incomplete network data, applicable to various types of complex network measurements.
Contribution
It presents a novel approach to infer network structure from imperfect data, accommodating multiple measurement types and noise, which advances empirical network analysis.
Findings
Effective estimation of network properties from noisy data
Applicable to social and biological networks
Improves accuracy of network analysis under data uncertainty
Abstract
Most empirical studies of networks assume that the network data we are given represent a complete and accurate picture of the nodes and edges in the system of interest, but in real-world situations this is rarely the case. More often the data only specify the network structure imperfectly -- like data in essentially every other area of empirical science, network data are prone to measurement error and noise. At the same time, the data may be richer than simple network measurements, incorporating multiple measurements, weights, lengths or strengths of edges, node or edge labels, or annotations of various kinds. Here we develop a general method for making estimates of network structure and properties using any form of network data, simple or complex, when the data are unreliable, and give example applications to a selection of social and biological networks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
