Network structure from rich but noisy data
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Driven by growing interest across the sciences, 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 error1–7. Accurate analysis and understanding of networked systems requires a way of estimating the true structure of networks from such rich but noisy data8–15. Here we describe a technique that allows us to make optimal estimates of network structure from complex data in arbitrary formats, including cases where there may be measurements of many different types, repeated observations, contradictory observations, annotations or metadata, or missing data. We give example applications to two different social networks, one derived from face-to-face interactions and one from self-reported friendships. A technique allows optimal inference of the structure of a network when the available observed data are rich but noisy, incomplete or otherwise unreliable.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
WGCNA: an R package for weighted correlation network analysis
Langfelder, P., & Horvath, S. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-559 · Cited by 27,252
A comprehensive analysis of protein–protein interactions in Saccharomyces cerevisiae
Uetz, P., Giot, L., Cagney, G., Mansfield, T. A., Judson, R. S., Knight, J. R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P., et al. (2000) · Nature · doi:10.1038/35001009 · Cited by 4,706 · cited 1×
“For instance, in a study of a protein–protein interaction network [1–3] one might compile a list of known protein interactions and represent them as a network of protein nodes joined by interaction edges.”
BackgroundA comprehensive two-hybrid analysis to explore the yeast protein interactome
Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., & Sakaki, Y. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.061034498 · Cited by 3,566 · cited 1×
“[(1 ) (1 ) (1 ) ] (17) i j i E i N E j E j N E A”
Protecting Adolescents From Harm: Findings From the National Longitudinal Study on Adolescent Health
Resnick, M. D. (1997) · JAMA · doi:10.1001/jama.1997.03550100049038 · Cited by 2,846 · cited 2×
“As another example, in studies of friend-ship networks [7, 8] one commonly assembles a network simply by asking people who their friends are.”
BackgroundMethodMargolin, A. A., Nemenman, I., Basso, K., Wiggins, C., Stolovitzky, G., Favera, R. D., & Califano, A. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-s1-s7 · Cited by 2,420
Hierarchical structure and the prediction of missing links in networks
Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171
Self-citationGenome-Scale Reconstruction of the Saccharomyces cerevisiae Metabolic Network
Förster, J., Famili, I., Fu, P., Palsson, B. Ø., & Nielsen, J. (2003) · Genome Research · doi:10.1101/gr.234503 · Cited by 1,069
Comparing Statistical Methods for Constructing Large Scale Gene Networks
Allen, J. D., Xie, Y., Chen, M., Girard, L., & Xiao, G. (2012) · PLoS ONE · doi:10.1371/journal.pone.0029348 · Cited by 186
Cited by
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Self-citationThe physics of higher-order interactions in complex systems
Battiston, F., Amico, E., Barrat, A., Bianconi, G., Ferraz de Arruda, G., Franceschiello, B., Iacopini, I., Kéfi, S., Latora, V., Moreno, Y., et al. (2021) · Nature Physics · doi:10.1038/s41567-021-01371-4 · Cited by 932
Metadata
- Authors
- Newman, M. E. J.
- Venue
- Nature Physics
- Published
- 2018-03-12
- Volume
- 14
- Issue
- 6
- Pages
- 542-545
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2787640683
- Cited by
- 225
- References
- 8
- FWCI
- 12.95
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Network structure from rich but noisy data. https://app.cochat.ai/papers/10.1038/s41567-018-0076-1
- The paper
- Newman, M. E. J. (2018). Network structure from rich but noisy data. Nature Physics. https://doi.org/10.1038/s41567-018-0076-1
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.